A note on diameter and the degree sequence of a graph (Q659834): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.aml.2011.08.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2057397453
@@ Property / OpenAlex ID: W2057397453 / rank @@
+Normal rank
@@ Property / cites work @@
+The average distance and the independence number
@@ Property / cites work: The average distance and the independence number / rank @@
+Normal rank
@@ Property / cites work @@
+Radius, diameter, and minimum degree
@@ Property / cites work: Radius, diameter, and minimum degree / rank @@
+Normal rank
@@ Property / cites work @@
+THE MAXIMUM CONNECTIVITY OF A GRAPH
@@ Property / cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH / rank @@
+Normal rank
@@ Property / cites work @@
+Diameters in graphs
@@ Property / cites work: Diameters in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Diameter and inverse degree
@@ Property / cites work: Diameter and inverse degree / rank @@
+Normal rank
@@ Property / cites work @@
+Q3832606
@@ Property / cites work: Q3832606 / rank @@
+Normal rank
@@ Property / cites work @@
+On diameter and inverse degree of a graph
@@ Property / cites work: On diameter and inverse degree of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Highly irregular graphs
@@ Property / cites work: Highly irregular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Average distance, minimum degree, and spanning trees
+Normal rank