scientific article; zbMATH DE number 2117218
From MaRDI portal
Publication:4828550
zbMath1061.05057MaRDI QIDQ4828550
Slobodan K. Simic, Peter Rowlinson, Dragos Cvetković
Publication date: 22 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Structural characterization of families of graphs (05C75) Matrices of integers (15B36)
Related Items (only showing first 100 items - show all)
Characterization of the minimizing graph of the connected graphs whose complements are bicyclic ⋮ More on graphs with just three distinct eigenvalues ⋮ A note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graph ⋮ The graphs with all but two eigenvalues equal to \(-2\) or 0 ⋮ A structure theory for graphs with fixed smallest eigenvalue ⋮ Signed line graphs with least eigenvalue -2: the star complement technique ⋮ The anti-adjacency matrix of a graph: eccentricity matrix ⋮ On graphs with just three distinct eigenvalues ⋮ On eigenspaces of some compound signed graphs ⋮ Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \) ⋮ The signless Laplacian matrix of hypergraphs ⋮ On graphs whose second largest eigenvalue equals 1 -- the star complement technique ⋮ Co-cliques and star complements in extremal strongly regular graphs ⋮ Applications of Estrada indices and energy to a family of compound graphs ⋮ On the characterization of graphs by star complements ⋮ Dynamical systems associated with adjacency matrices ⋮ Star complements and exceptional graphs ⋮ Signless Laplacians of finite graphs ⋮ Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\)) ⋮ On graphs with an eigenvalue of maximal multiplicity ⋮ Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\) ⋮ Spectral properties of the eccentricity matrix of graphs ⋮ Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows ⋮ Unnamed Item ⋮ Theorems on partitioned matrices revisited and their applications to graph spectra ⋮ A recursive construction of the regular exceptional graphs with least eigenvalue \(-2\) ⋮ Quadratic embedding constants of graph joins ⋮ The signature of two generalizations of line graphs ⋮ Some relations between the skew spectrum of an oriented graph and the spectrum of certain closely associated signed graphs ⋮ Polynomial reconstruction of signed graphs whose least eigenvalue is close to -2 ⋮ Fat Hoffman graphs with smallest eigenvalue greater than \(-3\) ⋮ Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1 ⋮ ILIGRA: an efficient inverse line graph algorithm ⋮ On the variants of first KCD energy ⋮ Unnamed Item ⋮ Graph spectra in computer science ⋮ The line graphs of lollipop graphs are determined by their spectra ⋮ Covering automorphisms and some eigenvalues of a graph ⋮ Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network ⋮ On the limit points of the smallest eigenvalues of regular graphs ⋮ On independent star sets in finite graphs ⋮ Star complements and connectivity in finite graphs ⋮ The polynomial reconstruction problem: the first 50 years ⋮ On graphs with exactly one anti-adjacency eigenvalue and beyond ⋮ On the nullity of the line graph of unicyclic graph with depth one ⋮ Unnamed Item ⋮ Unions of a clique and a co-clique as star complements for non-main graph eigenvalues ⋮ Graphs for which the least eigenvalue is minimal. I ⋮ Edge-signed graphs with smallest eigenvalue greater than \(-2\) ⋮ Star complementary strongly regular decompositions of strongly regular graphs ⋮ The spectral characterizations of the connected multicone graphs Kw ▽ LHS and Kw ▽ LGQ(3,9) ⋮ Regular star complements in strongly regular graphs ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ Modularity of directed networks: cycle decomposition approach ⋮ Q-integral graphs with edge-degrees at most five ⋮ Signed graphs with totally disconnected star complements ⋮ A problem concerning graphs with just three distinct eigenvalues ⋮ A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph ⋮ Spectra of quaternion unit gain graphs ⋮ On graphs whose star sets are (co-)cliques ⋮ On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\) ⋮ Star complements in regular graphs: old and new results ⋮ Towards a spectral theory of graphs based on the signless Laplacian. II. ⋮ On \(Q\)-integral graphs with edge-degrees at most six ⋮ On multiple eigenvalues of trees ⋮ The least eigenvalue of a graph with cut vertices ⋮ Further results on the least eigenvalue of connected graphs ⋮ The non-bipartite integral graphs with spectral radius three ⋮ On the largest eigenvalue of signed unicyclic graphs ⋮ Open problems in the spectral theory of signed graphs ⋮ On graphs with prescribed star complements ⋮ Unnamed Item ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey ⋮ Oriented gain graphs, line graphs and eigenvalues ⋮ Slobodan Simić: an appreciation ⋮ Some observations on the smallest adjacency eigenvalue of a graph ⋮ On graphs whose second largest eigenvalue is at most 1 ⋮ On nested split graphs whose second largest eigenvalue is less than 1 ⋮ The action of the Weyl group on the \(E_8\) root system ⋮ A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6) ⋮ Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\) ⋮ Cographs: eigenvalues and Dilworth number ⋮ Notes on exceptional signed graphs ⋮ Bipartite density of cubic graphs: The case of equality ⋮ The kite graph is determined by its adjacency spectrum ⋮ Reflexive line graphs of trees and Salem numbers ⋮ The multiplicity of eigenvalues of trees ⋮ Spectra of graphs resulting from various graph operations and products: a survey ⋮ On eigenvalue multiplicity in signed graphs ⋮ Regular character-graphs whose eigenvalues are greater than or equal to \(-2\) ⋮ The least eigenvalue of graphs whose complements are unicyclic ⋮ Fiedler vectors with unbalanced sign patterns ⋮ A decomposition of signed graphs with two eigenvalues ⋮ Star complements and edge-connectivity in finite graphs ⋮ Median eigenvalues of bipartite graphs ⋮ On the Laplacian coefficients of signed graphs ⋮ A Graph Theoretical Framework for the Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸n ⋮ Signed graphs whose spectrum is bounded by \(- 2\) ⋮ Reflexive line graphs of trees ⋮ Strong star complements in graphs
This page was built for publication: