On the sizes of graphs and their powers: the undirected case
From MaRDI portal
Publication:643002
DOI10.1016/J.DAM.2011.04.010zbMATH Open1228.05247OpenAlexW1966559200MaRDI QIDQ643002FDOQ643002
Authors: David Auger, Irène Charon, Olivier Hudry, Antoine 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
Recommendations
graph theorydiameterpower of a graphundirected graphidentifying codeHamiltonian graphedge numbersize of a graphtransitive closure of a graph
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal oriented graphs of diameter 2
- Title not available (Why is that?)
- The square of every two-connected graph is Hamiltonian
- Title not available (Why is that?)
- Diameters in graphs
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- On the sizes of the graphs \(G\), \(G^r\), \(G^r\setminus G\): the directed case
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Average degree in graph powers
- Growth of graph powers
- Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon
- Minimum rank of graphs powers family
- Title not available (Why is that?)
- On size, order, diameter and minimum degree
- Edge growth in graph powers
- On the sizes of the graphs \(G\), \(G^r\), \(G^r\setminus G\): the directed case
This page was built for publication: On the sizes of graphs and their powers: the undirected case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q643002)
