Wiener index of graphs with more than one cut-vertex
From MaRDI portal
Publication:998596
DOI10.1016/J.AML.2007.10.003zbMATH Open1152.05322OpenAlexW2006009162MaRDI QIDQ998596FDOQ998596
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
Cites Work
- Wiener index versus maximum degree in trees
- Superdominance order and distance of trees with bounded maximum degree
- Wiener index of trees: Theory and applications
- Parallel concepts in graph theory
- Wiener number of vertex-weighted graphs and a chemical application
- A textbook of graph theory
- Average distance and independence number
- Mean distance in a tree
Cited In (17)
- On the geometric-arithmetic index by decompositions -- CMMSE
- Kemeny's constant and Wiener index on trees
- Trees with the seven smallest and eight greatest Harary indices
- On the maximum Zagreb indices of graphs with \(k\) cut vertices
- Title not available (Why is that?)
- Maximum size of digraphs with some parameters
- Wiener, hyper-Wiener, detour and hyper-detour indices of bridge and chain graphs
- Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
- The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices
- Some indices of graphs with more than one cut-edge.
- Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs
- Extremal Zagreb indices of graphs with a given number of cut edges
- Ordering trees with given matching number by their Wiener indices
- The hyper-Wiener index of unicyclic graphs withnvertices andkpendent vertices
- The largest Wiener index of unicyclic graphs given girth or maximum degree
- Graphs whose Wiener index does not change when a specific vertex is removed
- Wiener index of graphs with fixed number of pendant or cut-vertices
Recommendations
This page was built for publication: Wiener index of graphs with more than one cut-vertex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998596)