Hamiltonicity in directed Toeplitz graphs having increasing edges of length 1, 3 and 7

MaRDI QIDQ6637457

Shabnam Malik, Farzaneh Ramezani

Publication date: 13 November 2024

Published in: The Journal of Prime Research in Mathematics (Search for Journal in Brave)

zbMATH Keywords

adjacency matrixHamiltonian graphToeplitz graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• On planar Toeplitz graphs
• On the chromatic number of Toeplitz graphs
• Hamiltonian properties of Toeplitz graphs
• On hamiltonian Toeplitz graphs
• Coloring planar Toeplitz graphs and the stable set polytope.
• Toeplitz graph decomposition
• Hamiltonicity in directed Toeplitz graphs of maximum (out or in) degree 4
• A generalization of the concept of Toeplitz graphs
• On super edge-magic deficiency of certain Toeplitz graphs
• On Super Edge-Antimagic Total Labeling of Toeplitz Graphs
• Hamiltonian Connectedness of Toeplitz Graphs
• Characterizing bipartite Toeplitz graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Hamiltonicity in directed Toeplitz graphs having increasing edges of length 1, 3 and 7

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637457)