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.



Related Items (only showing first 100 items - show all)

Characterization of the minimizing graph of the connected graphs whose complements are bicyclicMore on graphs with just three distinct eigenvaluesA note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graphThe graphs with all but two eigenvalues equal to \(-2\) or 0A structure theory for graphs with fixed smallest eigenvalueSigned line graphs with least eigenvalue -2: the star complement techniqueThe anti-adjacency matrix of a graph: eccentricity matrixOn graphs with just three distinct eigenvaluesOn eigenspaces of some compound signed graphsMixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)The signless Laplacian matrix of hypergraphsOn graphs whose second largest eigenvalue equals 1 -- the star complement techniqueCo-cliques and star complements in extremal strongly regular graphsApplications of Estrada indices and energy to a family of compound graphsOn the characterization of graphs by star complementsDynamical systems associated with adjacency matricesStar complements and exceptional graphsSignless Laplacians of finite graphsMinimal 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 multiplicityPermanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)Spectral properties of the eccentricity matrix of graphsGraphs whose adjacency matrices have rank equal to the number of distinct nonzero rowsUnnamed ItemTheorems on partitioned matrices revisited and their applications to graph spectraA recursive construction of the regular exceptional graphs with least eigenvalue \(-2\)Quadratic embedding constants of graph joinsThe signature of two generalizations of line graphsSome relations between the skew spectrum of an oriented graph and the spectrum of certain closely associated signed graphsPolynomial reconstruction of signed graphs whose least eigenvalue is close to -2Fat Hoffman graphs with smallest eigenvalue greater than \(-3\)Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1ILIGRA: an efficient inverse line graph algorithmOn the variants of first KCD energyUnnamed ItemGraph spectra in computer scienceThe line graphs of lollipop graphs are determined by their spectraCovering automorphisms and some eigenvalues of a graphMinimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical networkOn the limit points of the smallest eigenvalues of regular graphsOn independent star sets in finite graphsStar complements and connectivity in finite graphsThe polynomial reconstruction problem: the first 50 yearsOn graphs with exactly one anti-adjacency eigenvalue and beyondOn the nullity of the line graph of unicyclic graph with depth oneUnnamed ItemUnions of a clique and a co-clique as star complements for non-main graph eigenvaluesGraphs for which the least eigenvalue is minimal. IEdge-signed graphs with smallest eigenvalue greater than \(-2\)Star complementary strongly regular decompositions of strongly regular graphsThe spectral characterizations of the connected multicone graphs Kw ▽ LHS and Kw ▽ LGQ(3,9)Regular star complements in strongly regular graphsGraphs with least eigenvalue \(-2\): ten years onModularity of directed networks: cycle decomposition approachQ-integral graphs with edge-degrees at most fiveSigned graphs with totally disconnected star complementsA problem concerning graphs with just three distinct eigenvaluesA sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graphSpectra of quaternion unit gain graphsOn graphs whose star sets are (co-)cliquesOn the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\)Star complements in regular graphs: old and new resultsTowards a spectral theory of graphs based on the signless Laplacian. II.On \(Q\)-integral graphs with edge-degrees at most sixOn multiple eigenvalues of treesThe least eigenvalue of a graph with cut verticesFurther results on the least eigenvalue of connected graphsThe non-bipartite integral graphs with spectral radius threeOn the largest eigenvalue of signed unicyclic graphsOpen problems in the spectral theory of signed graphsOn graphs with prescribed star complementsUnnamed ItemRecent progress on graphs with fixed smallest adjacency eigenvalue: a surveyOriented gain graphs, line graphs and eigenvaluesSlobodan Simić: an appreciationSome observations on the smallest adjacency eigenvalue of a graphOn graphs whose second largest eigenvalue is at most 1On nested split graphs whose second largest eigenvalue is less than 1The action of the Weyl group on the \(E_8\) root systemA 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 numberNotes on exceptional signed graphsBipartite density of cubic graphs: The case of equalityThe kite graph is determined by its adjacency spectrumReflexive line graphs of trees and Salem numbersThe multiplicity of eigenvalues of treesSpectra of graphs resulting from various graph operations and products: a surveyOn eigenvalue multiplicity in signed graphsRegular character-graphs whose eigenvalues are greater than or equal to \(-2\)The least eigenvalue of graphs whose complements are unicyclicFiedler vectors with unbalanced sign patternsA decomposition of signed graphs with two eigenvaluesStar complements and edge-connectivity in finite graphsMedian eigenvalues of bipartite graphsOn the Laplacian coefficients of signed graphsA Graph Theoretical Framework for the Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸nSigned graphs whose spectrum is bounded by \(- 2\)Reflexive line graphs of treesStrong star complements in graphs




This page was built for publication: