On the minimum 2-wide diameter of cycles with chords

zbMATH Open1212.05140MaRDI QIDQ3572604FDOQ3572604

Authors: Gexin Yu, Bolian Liu, Xinmin Hou 

Publication date: 8 July 2010

Recommendations

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

zbMATH Keywords

graphnetworkconnectivitywide diameter

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40)

Cited In (4)

• Minimum length of cycles through specified vertices in graphs with wide-diameter at most \(d\).
• Title not available (Why is that?)
• An upper bound on the number of edges of a graph whose \(k\)th power has a connected complement
• The least possible diameter for \(C_n+3e\)

This page was built for publication: On the minimum 2-wide diameter of cycles with chords

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