Extremal degree resistance distances in fully loaded unicyclic graphs.

zbMATH Open1363.05040MaRDI QIDQ2822809FDOQ2822809

Authors: Xia Cai, Zhijun Guo, Ting Zeng, Jing Chen, Shubo Chen 

Publication date: 5 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• Maximal degree resistance distance of unicyclic graphs
• The unicyclic graphs with maximum degree resistance distance
• Extremal properties of Kirchhoff index and degree resistance distance of unicyclic graphs
• Degree resistance distance of unicyclic graphs
• Maximum reciprocal degree resistance distance index of unicyclic graphs
• Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum
• Bicyclic graphs with maximum degree resistance distance
• Resistance distances in vertex-weighted complete multipartite graphs
• Resistance distance in complete \(n\)-partite graphs
• scientific article; zbMATH DE number 6739955

zbMATH Keywords

degree resistance distancefully loaded unicyclic graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Distance in graphs (05C12) Paths and cycles (05C38)

Cited In (4)

• Maximum reciprocal degree resistance distance index of unicyclic graphs
• The extremal Kirchhoff index of a class of unicyclic graphs
• The unicyclic graphs with maximum degree resistance distance
• Title not available (Why is that?)

This page was built for publication: Extremal degree resistance distances in fully loaded unicyclic graphs.

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