The minimal Kirchhoff index of graphs with a given number of cut vertices

DOI10.2298/FIL1613451XzbMath1462.05129OpenAlexW1787661183MaRDI QIDQ5279620

Yujun Yang, Hongshuang Liu, Kexiang Xu, Kinkar Chandra Das

Publication date: 19 July 2017

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1613451x

zbMATH Keywords

resistance distanceKirchhoff indexcut vertex

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (6)

Maximum resistance-Harary index of cacti ⋮ On Sombor Index of Graphs with a Given Number of Cut-Vertices ⋮ Proofs to some open problems on the maximum Sombor index of graphs ⋮ Maximum reciprocal degree resistance distance index of unicyclic graphs ⋮ Network similarity measure and Ediz eccentric connectivity index ⋮ Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index

This page was built for publication: The minimal Kirchhoff index of graphs with a given number of cut vertices