Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods (Q1297416): Difference between revisions

← Older edit

@@ Property / cites work @@
+\(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
+Normal rank
@@ Property / cites work @@
+Diameters and Eigenvalues
@@ Property / cites work: Diameters and Eigenvalues / rank @@
+Normal rank
@@ Property / cites work @@
+An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
+Normal rank
@@ Property / cites work @@
+Diameter, covering index, covering radius and eigenvalues
+Normal rank
@@ Property / cites work @@
+On a class of polynomials and its relation with the spectra and diameters of graphs
+Normal rank
@@ Property / cites work @@
+From regular boundary graphs to antipodal distance-regular graphs
+Normal rank
@@ Property / cites work @@
+Boundary graphs: The limit case of a spectral property
+Normal rank
@@ Property / cites work @@
+Boundary graphs. II: The limit case of a spectral property
+Normal rank
@@ Property / cites work @@
+The alternating polynomials and their relation with the spectra and conditional diameters of graphs
+Normal rank
@@ Property / cites work @@
+Q4873761
@@ Property / cites work: Q4873761 / rank @@
+Normal rank
@@ Property / cites work @@
+Eigenvalues, diameter, and mean distance in graphs
+Normal rank
@@ Property / cites work @@
+Spectral diameter estimates for \(k\)-regular graphs
+Normal rank
@@ Property / cites work @@
+Q3999365
@@ Property / cites work: Q3999365 / rank @@
+Normal rank
@@ Property / cites work @@
+Eigenvalues and the diameter of graphs
@@ Property / cites work: Eigenvalues and the diameter of graphs / rank @@
+Normal rank
@@ Property / Recommended article @@
+Eigenvalues, diameter, and mean distance in graphs
+Normal rank
+Similarity Score: 0.9299331Amount 0.9299331
Unit 1
-Amount
+.9299331
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On the distance and distance Laplacian eigenvalues of graphs
+Normal rank
+Similarity Score: 0.9293945Amount 0.9293945
Unit 1
-Amount
+.9293945
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
+Normal rank
+Similarity Score: 0.92483616Amount 0.92483616
Unit 1
-Amount
+.92483616
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On the Sum of Distance Laplacian Eigenvalues of Graphs
+Normal rank
+Similarity Score: 0.91244686Amount 0.91244686
Unit 1
-Amount
+.91244686
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Eigenvalues and the diameter of graphs
@@ Property / Recommended article: Eigenvalues and the diameter of graphs / rank @@
+Normal rank
+Similarity Score: 0.9111691Amount 0.9111691
Unit 1
-Amount
+.9111691
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On the normalized distance Laplacian eigenvalues of graphs
+Normal rank
+Similarity Score: 0.9096301Amount 0.9096301
Unit 1
-Amount
+.9096301
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+An eigenvalue bound for the Laplacian of a graph
+Normal rank
+Similarity Score: 0.9083826Amount 0.9083826
Unit 1
-Amount
+.9083826
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+The diameter and Laplacian eigenvalues of directed graphs
+Normal rank
+Similarity Score: 0.90540326Amount 0.90540326
Unit 1
-Amount
+.90540326
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Bounds for Laplacian graph eigenvalues
@@ Property / Recommended article: Bounds for Laplacian graph eigenvalues / rank @@
+Normal rank
+Similarity Score: 0.904822Amount 0.904822
Unit 1
-Amount
+.904822
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Bounding the gap between extremal Laplacian eigenvalues of graphs
+Normal rank
+Similarity Score: 0.9041348Amount 0.9041348
Unit 1
-Amount
+.9041348
 Unit
+Recommender Run: Recommender Run 2

Latest revision as of 12:02, 4 April 2025

scientific article

Language	Label	Description	Also known as
English	Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods	scientific article

Statements

instance of

scholarly article

0 references

title

Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods (English)

0 references

published in

Discrete Mathematics

0 references

publication date

9 August 1999

0 references

review text

The paper compares some recent bounds on the diameter and mean distance of graphs in terms of the eigenvalues of either the adjacency matrix or the Laplacian matrix of the graph.

0 references

zbMATH Keywords

diameter

0 references

mean distance

0 references

eigenvalues

0 references

adjacency matrix

0 references

Laplacian matrix

0 references