Pages that link to "Item:Q1262322"

The following pages link to Radius, diameter, and minimum degree (Q1262322):

Displaying 50 items.

• Some properties on the tensor product of graphs obtained by monogenic semigroups (Q272447) (← links)
• Some remarks on rainbow connectivity (Q322204) (← links)
• Improved bound on the oriented diameter of graphs with given minimum degree (Q326665) (← links)
• A new bound of radius with irregularity index (Q371455) (← links)
• Minimum degree, edge-connectivity and radius (Q385477) (← links)
• The Steiner diameter of a graph with prescribed girth (Q389482) (← links)
• A characterization of graphs by codes from their incidence matrices (Q396825) (← links)
• Upper bounds on the Steiner diameter of a graph (Q444450) (← links)
• Minimum orders of Eulerian oriented digraphs with given diameter (Q477806) (← links)
• A cut locus for finite graphs and the farthest point mapping (Q501076) (← links)
• Diameter, minimum degree and hyperbolicity constant in graphs (Q510987) (← links)
• The number of edges in a bipartite graph of given radius (Q533777) (← links)
• Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts (Q642989) (← links)
• The maximum radius of graphs with given order and minimum degree (Q658041) (← links)
• A note on diameter and the degree sequence of a graph (Q659834) (← links)
• On size, order, diameter and edge-connectivity of graphs (Q682097) (← links)
• An upper bound on the radius of a 3-edge-connected \(C_4\)-free graph (Q821263) (← links)
• An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph (Q827214) (← links)
• An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph (Q828980) (← links)
• Diameter and maximum degree in Eulerian digraphs (Q906483) (← links)
• Domination, radius, and minimum degree (Q967345) (← links)
• Nordhaus-Gaddum relations for proximity and remoteness in graphs (Q988253) (← links)
• Minimum size of a graph or digraph of given radius (Q989544) (← links)
• Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
• Formally verified algorithms for upper-bounding state space diameters (Q1663245) (← links)
• On a classical theorem on the diameter and minimum degree of a graph (Q1686901) (← links)
• The radius of \(k\)-connected planar graphs with bounded faces (Q1759405) (← links)
• The diameter of directed graphs (Q1775900) (← links)
• Rainbow connections of graphs: a survey (Q1938889) (← links)
• Average eccentricity, minimum degree and maximum degree in graphs (Q2023121) (← links)
• On average distance in tournaments and Eulerian digraphs (Q2026317) (← links)
• Line graphs of monogenic semigroup graphs (Q2035709) (← links)
• Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree (Q2037591) (← links)
• Size of graphs and digraphs with given diameter and connectivity constraints (Q2043684) (← links)
• The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees (Q2165277) (← links)
• On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs (Q2172411) (← links)
• Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity (Q2223416) (← links)
• An improvement to Chvátal and Thomassen's upper bound for oriented diameter (Q2231791) (← links)
• Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs (Q2334045) (← links)
• Diameter of orientations of graphs with given minimum degree (Q2349963) (← links)
• On the connectivity of diamond-free graphs (Q2384395) (← links)
• Some properties on the lexicographic product of graphs obtained by monogenic semigroups (Q2637547) (← links)
• Distances in graphs of girth 6 and generalised cages (Q2656962) (← links)
• The average eccentricity of a graph with prescribed girth (Q2675826) (← links)
• Concentration of rainbow \(k\)-connectivity of a multiplex random graph (Q2689447) (← links)
• Diameter, edge-connectivity, and \(C_4\)-freeness (Q2689491) (← links)
• NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS (Q2890987) (← links)
• Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems (Q3467873) (← links)
• Decompositions into Subgraphs of Small Diameter (Q4911111) (← links)
• Average distance, minimum degree, and spanning trees (Q4944680) (← links)