A note on the spectral characterization of strongly connected bicyclic digraphs (Q2427939): Difference between revisions

@@ Property / cites work @@
+Q4500916
@@ Property / cites work: Q4500916 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing isospectral non‐isomorphic digraphs from hypergraphs
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Spectra of digraphs
@@ Property / cites work: Spectra of digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3642517
@@ Property / cites work: Q3642517 / rank @@
+Normal rank
@@ Property / cites work @@
+An iterative construction of isospectral digraphs
@@ Property / cites work: An iterative construction of isospectral digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Which graphs are determined by their spectrum?
@@ Property / cites work: Which graphs are determined by their spectrum? / rank @@
+Normal rank
@@ Property / cites work @@
+Developments on spectral characterizations of graphs
+Normal rank
@@ Property / cites work @@
+A sharp upper bound of the spectral radius of graphs
+Normal rank
@@ Property / cites work @@
+On the spectral characterizations of \(\infty \)-graphs
+Normal rank
@@ Property / cites work @@
+A note on the spectral characterization of dumbbell graphs
+Normal rank
@@ Property / cites work @@
+Spectral bounds for the clique and independence numbers of graphs
+Normal rank
@@ Property / cites work @@
+The spectral radius of trees on \(k\) pendant vertices
+Normal rank