An upper bound on the number of edges of a graph whose kth power has a connected complement

DOI10.1007/S10958-018-3860-7MaRDI QIDQ1661501zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• Edge-wide-diameter of graphs with diameter d
• On the minimum 2-wide diameter of cycles with chords
• Wide-diameter and minimum length of fan
• On generalized wide diameter of graphs.
• Minimum length of cycles through specified vertices in graphs with wide-diameter at most \(d\).

Cites work

• scientific article; zbMATH DE number 1025912 (Why is no real title available?)
• Graph theory with applications
• Some Hamiltonian results in powers of graphs
• The cube of every connected graph is 1-hamiltonian
• The square of every two-connected graph is Hamiltonian

Cited in

(2)

• A novel discussion on power fuzzy graphs and their application in decision making
• A generalization of a Turán's theorem about maximum clique on graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661501)