A study on distance in graph complement
From MaRDI portal
Publication:4965911
DOI10.1142/S1793830920500457zbMath1456.05048MaRDI QIDQ4965911
A. Wilson Baskar, A. Chellaram Malaravan
Publication date: 18 March 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some parameters of graph and its complement
- A graph and its complement with specified properties. VI: Chromatic and achromatic numbers
- A graph and its complement with specified properties. III: Girth and circumference
- A graph and its complement with specified properties. I: Connectivity
- Graphs G for which G and \(\bar G\) are both semidecomposable
- Graphs \(G\) for which both \(G\) and \(\overline {G}\) are contraction critically \(k\)-connected
- A study on center of a graph complement
- A graph and its complement with specified properties. IV. Counting self-complementary blocks
- The Diameter of a Graph and its Complement
- A graph and its complement with specified properties V: The self‐complement index
This page was built for publication: A study on distance in graph complement