Minimum degree, edge-connectivity and radius

DOI10.1007/S10878-012-9479-6zbMATH Open1282.90224OpenAlexW2017746246MaRDI QIDQ385477FDOQ385477

Xiaoping Liu, Guiying Yan, Guojie Liu, Baoyindureng Wu, Xinhui An

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)

Cites Work

• Radius, diameter, and minimum degree
• Mean distance and minimum degree
• Diameter of 4-colourable graphs
• Using minimum degree to bound average distance
• A characterization of radius-critical graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Domination, radius, and minimum degree
• Minimum size of a graph or digraph of given radius

Cited In (10)

• Title not available (Why is that?)
• Relations between degree-based graph invariants
• Title not available (Why is that?)
• Embeddings into almost self-centered graphs of given radius
• The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs
• On maximum Wiener index of trees and graphs with given radius
• Radius, girth and minimum degree
• Title not available (Why is that?)
• Radius, leaf number, connected domination number and minimum degree
• Comparative results and bounds for the eccentric-adjacency index

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

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