On the sizes of graphs and their powers: the undirected case
From MaRDI portal
Publication:643002
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
graph theorydiameterHamiltonian graphundirected graphpower of a graphidentifying codeedge numbersize of a graphtransitive closure of a graph
Related Items
Cites Work