An upper bound on the number of edges of a graph whose \(k\)th power has a connected complement

DOI10.1007/S10958-018-3860-7zbMath1393.05216OpenAlexW2804416073WikidataQ129803672 ScholiaQ129803672MaRDI QIDQ1661501

V. S. Samoilov

Publication date: 16 August 2018

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-018-3860-7

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (1)

A generalization of a Turán’s theorem about maximum clique on graphs

Cites Work

• The square of every two-connected graph is Hamiltonian
• The cube of every connected graph is 1-hamiltonian
• Some Hamiltonian results in powers of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: An upper bound on the number of edges of a graph whose \(k\)th power has a connected complement