A conjecture on the spectral radius of graphs (Q2174432): Difference between revisions

@@ Property / author @@
-Kinkar Chandra Das
@@ Property / author: Kinkar Chandra Das / rank @@
-Normal rank
@@ Property / author @@
+Kinkar Chandra Das
@@ Property / author: Kinkar Chandra Das / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q123009927
@@ Property / Wikidata QID: Q123009927 / rank @@
+Normal rank
@@ 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.laa.2019.11.028
+Normal rank
@@ Property / OpenAlex ID @@
+W2989573021
@@ Property / OpenAlex ID: W2989573021 / rank @@
+Normal rank
@@ Property / cites work @@
+A necessary and sufficient eigenvector condition for a connected graph to be bipartite
+Normal rank
@@ Property / cites work @@
+Q3497899
@@ Property / cites work: Q3497899 / rank @@
+Normal rank
@@ Property / cites work @@
+Sharp upper bounds of the spectral radius of a graph
+Normal rank
@@ Property / cites work @@
+Bounds for the spectral radius of a graph when nodes are removed
+Normal rank
@@ Property / cites work @@
+Q3191862
@@ Property / cites work: Q3191862 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2174432