Eccentric counts, connectivity and chordality (Q1941698): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2012.08.022
+Normal rank
@@ Property / OpenAlex ID @@
+W1973747265
@@ Property / OpenAlex ID: W1973747265 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Centers of chordal graphs
@@ Property / cites work: Centers of chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Centers of triangulated graphs
@@ Property / cites work: Centers of triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Additive sparse spanners for graphs with bounded length of largest induced cycle
+Normal rank
@@ Property / cites work @@
+On eccentricity sequences of connected graphs
@@ Property / cites work: On eccentricity sequences of connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3410103
@@ Property / cites work: Q3410103 / rank @@
+Normal rank
@@ Property / cites work @@
+Eccentric sequences in graphs
@@ Property / cites work: Eccentric sequences in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of vertices with specified eccentricity
+Normal rank
@@ Property / cites work @@
+A simple relationship between the diameter and the radius of a graph
+Normal rank