On the sizes of graphs and their powers: the undirected case

DOI10.1016/j.dam.2011.04.010zbMath1228.05247OpenAlexW1966559200MaRDI QIDQ643002

Olivier Hudry, David Auger, Irène Charon, Antoine C. Lobstein

Publication date: 27 October 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.04.010

zbMATH Keywords

graph theorydiameterHamiltonian graphundirected graphpower of a graphidentifying codeedge numbersize of a graphtransitive closure of a graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items

On size, order, diameter and minimum degree

Cites Work

• Extremal cardinalities for identifying and locating-dominating codes in graphs
• Minimal oriented graphs of diameter 2
• The square of every two-connected graph is Hamiltonian
• Diameters in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item