On the sizes of graphs and their powers: the undirected case
From MaRDI portal
(Redirected from Publication:643002)
Recommendations
Cites work
- scientific article; zbMATH DE number 3156011 (Why is no real title available?)
- scientific article; zbMATH DE number 1248190 (Why is no real title available?)
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- scientific article; zbMATH DE number 3258080 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- Diameters in graphs
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Minimal oriented graphs of diameter 2
- On the sizes of the graphs \(G\), \(G^r\), \(G^r\setminus G\): the directed case
- The square of every two-connected graph is Hamiltonian
Cited in
(8)- Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon
- Average degree in graph powers
- On the sizes of the graphs \(G\), \(G^r\), \(G^r\setminus G\): the directed case
- Minimum rank of graphs powers family
- On size, order, diameter and minimum degree
- Edge growth in graph powers
- scientific article; zbMATH DE number 1990713 (Why is no real title available?)
- Growth of graph powers
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)