Radius, diameter and the degree sequence of a graph

DOI10.1515/MS-2015-0084MaRDI QIDQ5744306zbMATH OpenOpenAlexFDO

Authors J. P. Mazorodze, Simon Mukwembi

Publication date 18 February 2016

Published in Mathematica Slovaca (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/ms-2015-0084

zbMATH Keywords

degree sequencediametermaximum degreeminimum degreeradius

Mathematics Subject Classification ID

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

Recommendations

• Radius, diameter, and minimum degree
• On size, order, diameter and minimum degree
• Radius, girth and minimum degree
• On size, radius and minimum degree
• On size, order, diameter and edge-connectivity of graphs

Cites work

• A note on diameter and the degree sequence of a graph
• Notes on the betweenness centrality of a graph
• Radius, diameter, and minimum degree

Cited in

(21)

• A simple relationship between the diameter and the radius of a graph
• Radius, diameter, and minimum degree
• Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity
• Sharp Bounds on the Diameter of a Graph
• A new bound of radius with irregularity index
• On upper bounds in tree-diameter sets of graphs
• On size, order, diameter and minimum degree
• Diameter Bounds for Graph Extensions
• scientific article; zbMATH DE number 2014474 (Why is no real title available?)
• Majorants and minorants for the classes of graphs with fixed diameter and number of vertices
• Sequences of radius \(k\) for complete bipartite graphs
• The number of edges in a bipartite graph of given radius
• On size, radius and minimum degree
• scientific article; zbMATH DE number 2188620 (Why is no real title available?)
• Diameter and connectivity of finite simple graphs
• Bounds on the Steiner radius of a graph
• Radius, girth and minimum degree
• A note on diameter and the degree sequence of a graph
• On size, order, diameter and edge-connectivity of graphs
• The k-radius of 2-connected graphs
• An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph

This page was built for publication: Radius, diameter and the degree sequence of a graph

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