Minimum degree, edge-connectivity and radius

DOI10.1007/s10878-012-9479-6zbMath1282.90224OpenAlexW2017746246MaRDI QIDQ385477

Guojie Liu, Baoyindureng Wu, Xinhui An, Gui Ying Yan, Xiao-Ping Liu

Publication date: 2 December 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9479-6

zbMATH Keywords

minimum degreeradiusedge-connectivity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (6)

Embeddings into almost self-centered graphs of given radius ⋮ On maximum Wiener index of trees and graphs with given radius ⋮ Radius, leaf number, connected domination number and minimum degree ⋮ Comparative results and bounds for the eccentric-adjacency index ⋮ The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs ⋮ Relations between degree-based graph invariants

Cites Work

• Domination, radius, and minimum degree
• Minimum size of a graph or digraph of given radius
• Diameter of 4-colourable graphs
• Radius, diameter, and minimum degree
• Using minimum degree to bound average distance
• A characterization of radius-critical graphs
• Mean distance and minimum degree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum degree, edge-connectivity and radius