The hyper-Wiener index of graphs with a given chromatic (clique) number

zbMATH Open1255.05060MaRDI QIDQ4898161FDOQ4898161

Authors: Guihai Yu, Lihua Feng, Weijun Liu 

Publication date: 29 December 2012

Recommendations

• The hyper-Wiener index of bicyclic graphs
• On the extremal Wiener indices of some graphs
• The hyper-Wiener index of unicyclic graphs
• The hyper-Wiener index of trees with given parameters.
• Bounds on hyper-Wiener index of graphs

zbMATH Keywords

Wiener index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Cited In (10)

• Bounds on hyper-Wiener index of graphs
• On the extremal Wiener indices of some graphs
• Maximal distance spectral radius of 4-chromatic planar graphs
• The relationships between Wiener index, stability number and clique number of composite graphs
• Hyper-Wiener index of Eulerian graphs
• Hyper-Wiener and Harary indices of graphs with cut edges
• Nordhaus-Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts
• Title not available (Why is that?)
• A lower bound for the \(t\)-tone chromatic number of a graph in terms of Wiener index
• Title not available (Why is that?)

This page was built for publication: The hyper-Wiener index of graphs with a given chromatic (clique) number

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