Pages that link to "Item:Q1759806"
From MaRDI portal
The following pages link to Proof of conjectures on adjacency eigenvalues of graphs (Q1759806):
Displaying 23 items.
- Complete split graph determined by its (signless) Laplacian spectrum (Q266926) (← links)
- The spectral characterization of wind-wheel graphs (Q308318) (← links)
- Core-satellite graphs: clustering, assortativity and spectral properties (Q503412) (← links)
- Combinatorial and spectral properties of König-Egerváry graphs (Q516875) (← links)
- The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\) (Q517364) (← links)
- On problems and conjectures on adjointly equivalent graphs (Q556853) (← links)
- Proof of a conjecture on `plateaux' phenomenon of graph Laplacian eigenvalues (Q739109) (← links)
- When local and global clustering of networks diverge (Q896850) (← links)
- Graphs with the same determinant as a complete graph (Q1573672) (← links)
- Kite graphs determined by their spectra (Q1735065) (← links)
- Proof of conjectures involving algebraic connectivity of graphs (Q1947091) (← links)
- Adjacency eigenvalues of graphs without short odd cycles (Q2237217) (← links)
- Proof of a conjecture involving the second largest \(D\)-eigenvalue and the number of triangles (Q2259279) (← links)
- The graphs with all but two eigenvalues equal to \(\pm 1\) (Q2346766) (← links)
- The difference between remoteness and radius of a graph (Q2348060) (← links)
- On minimally 2-(edge)-connected graphs with extremal spectral radius (Q2421875) (← links)
- Proof of conjectures on remoteness and proximity in graphs (Q2449108) (← links)
- On the spectral radius of bipartite graphs which are nearly complete (Q2636687) (← links)
- WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS (Q5044603) (← links)
- Comparison between Szeged indices of graphs (Q5129752) (← links)
- Connected graphs cospectral with a friendship graph (Q5135785) (← links)
- Laplacian spectral determination of path-friendship graphs (Q5165018) (← links)
- Monster graphs are determined by their Laplacian spectra (Q5880902) (← links)
