Wiener index of graphs with more than one cut-vertex
From MaRDI portal
Publication:998596
DOI10.1016/j.aml.2007.10.003zbMath1152.05322OpenAlexW2006009162MaRDI QIDQ998596
Publication date: 29 January 2009
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2007.10.003
Related Items (15)
Maximum size of digraphs with some parameters ⋮ The hyper-Wiener index of unicyclic graphs withnvertices andkpendent vertices ⋮ Wiener index of graphs with fixed number of pendant or cut-vertices ⋮ The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices ⋮ Kemeny's constant and Wiener index on trees ⋮ Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts ⋮ Extremal Zagreb indices of graphs with a given number of cut edges ⋮ Ordering trees with given matching number by their Wiener indices ⋮ The largest Wiener index of unicyclic graphs given girth or maximum degree ⋮ On the geometric-arithmetic index by decompositions -- CMMSE ⋮ Wiener, hyper-Wiener, detour and hyper-detour indices of bridge and chain graphs ⋮ On the maximum Zagreb indices of graphs with \(k\) cut vertices ⋮ Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs ⋮ Trees with the seven smallest and eight greatest Harary indices ⋮ Unnamed Item
Cites Work
- Parallel concepts in graph theory
- Average distance and independence number
- Wiener number of vertex-weighted graphs and a chemical application
- Wiener index versus maximum degree in trees
- Mean distance in a tree
- Superdominance order and distance of trees with bounded maximum degree
- A textbook of graph theory
- Wiener index of trees: Theory and applications
This page was built for publication: Wiener index of graphs with more than one cut-vertex
