scientific article

zbMath0878.05057MaRDI QIDQ2785496

Slobodan K. Simic, Dragos Cvetković, Peter Rowlinson

Publication date: 24 February 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexityalgorithmsstrongly regular graphsspectrumperfect matchingPetersen graphspectral graph theoryspectral invariantsanglesmaximal indexstar partitioncospectral treesmain partstar bases

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

An edge-rotating theorem on the least eigenvalue of graphs, Graph reduction techniques and the multiplicity of the Laplacian eigenvalues, Biregular graphs with three eigenvalues, A formalism for evaluating analytically the cross-correlation structure of a firing-rate network model, Axioms for centrality scoring with principal eigenvectors, On the combinatorics of smoothing, Signed line graphs with least eigenvalue -2: the star complement technique, Communicability graph and community structures in complex networks, On eigenspaces of some compound signed graphs, Graph homomorphisms and nodal domains, On graphs whose second largest eigenvalue equals 1 -- the star complement technique, Relations between connected and self-avoiding hikes in labelled complete digraphs, Co-cliques and star complements in extremal strongly regular graphs, Spectral radii of graphs with given chromatic number, Cospectral graphs and the generalized adjacency matrix, Old and new results on algebraic connectivity of graphs, Some notes on graphs whose index is close to 2, The spectra of some families of digraphs, Star complements and exceptional graphs, Signless Laplacians of finite graphs, On the index of necklaces, Spectral results on regular graphs with \((k,\tau)\)-regular sets, Inequalities for the number of walks in graphs, Homomorphisms, representations and characteristic polynomials of digraphs, Graphs for small multiprocessor interconnection networks, Trees, unicyclic graphs and bicyclic graphs with exactly two \(Q\)-main eigenvalues, Tricyclic graphs with exactly two main eigenvalues, Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows, Theorems on partitioned matrices revisited and their applications to graph spectra, A spectral equivalent condition of the \(P\)-polynomial property for association schemes, On the private provision of public goods on networks, Projection approaches to process mining using region-based techniques, When local and global clustering of networks diverge, Path Laplacian matrices: introduction and application to the analysis of consensus in networks, Graph spectra in computer science, The efficiency and stability of R\&D networks, A characterization of skew Hadamard matrices and doubly regular tournaments, Minimizing the least eigenvalue of graphs with fixed order and size, Some results on graphs with exactly two main eigenvalues, Graphs for which the least eigenvalue is minimal. I, Unoriented Laplacian maximizing graphs are degree maximal, Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph, A gradient-type algorithm optimizing the coupling between matrices, Cacti whose spread is maximal, A note on connected bipartite graphs of fixed order and size with maximal index, Some new considerations about double nested graphs, Graphs with least eigenvalue \(-2\): ten years on, The overgraphs of generalized cospectral controllable graphs, Construction of graphs with exactly \(k\) main eigenvalues, Ordering graphs with index in the interval \((2, \sqrt{2+\sqrt 5})\), Core-satellite graphs: clustering, assortativity and spectral properties, Graphs for which the least eigenvalue is minimal. II., Construction of graphs with distinct eigenvalues, On eigensharp and almost eigensharp graphs, Clique-inserted-graphs and spectral dynamics of clique-inserting, Graphs with a common eigenvalue deck, Tree decomposition by eigenvectors, On graphs whose star sets are (co-)cliques, Spectral properties of a class of unicyclic graphs, On least eigenvalues of bicyclic graphs with fixed number of pendant vertices, The local spectra of regular line graphs, Star complements in regular graphs: old and new results, Towards a spectral theory of graphs based on the signless Laplacian. II., On the spectral radius of unicyclic graphs with prescribed degree sequence, Semiregular trees with minimal Laplacian spectral radius, Connected graphs of fixed order and size with maximal index: some spectral bounds, On the power of combinatorial and spectral invariants, Main eigenvalues and \((\kappa ,\tau )\)-regular sets, The Laplacian spectral radius of trees and maximum vertex degree, Minimal Euclidean representations of graphs, Some characterizations of strongly regular graphs with respect to their vertex deleted subgraphs, On edge star sets in trees, On the eigenvalues of distance powers of circuits, Further results on the least eigenvalue of connected graphs, Trees with minimal index and diameter at most four, On the least eigenvalue of cacti, On eigenvalue multiplicity and the girth of a graph, Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case, On perturbations of almost distance-regular graphs, The spread of unicyclic graphs with given size of maximum matchings, On the largest eigenvalues of trees with perfect matchings, On the isoperimetric spectrum of graphs and its approximations, A note on Hoffman-type identities of graphs, Network robustness to targeted attacks. The interplay of expansibility and degree distribution, Spectra of generalized compositions of graphs and hierarchical networks, On the spectral radius of quasi-\(k\)-cyclic graphs, Spectra of large random trees, The spectral radius of bicyclic graphs with prescribed degree sequences, Spectral upper bounds for the order of a \(k\)-regular induced subgraph, Bicyclic graphs for which the least eigenvalue is minimum, Bicyclic graphs with exactly two main eigenvalues, Matchings in regular graphs from eigenvalues, The Laplacian spectral radius of a graph under perturbation, Returnability in complex directed networks (digraphs), On nested split graphs whose second largest eigenvalue is less than 1, A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6), Unicyclic graphs with exactly two main eigenvalues, Some characterizations of strongly regular graphs, Asymptotic results on the spectral radius and the diameter of graphs, Signed graphs with extremal least Laplacian eigenvalue, Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles, Equiangular lines in Euclidean spaces: Dimensions 17 and 18, The general spectral radii of (multicone-)graphs with prescribed degree sequence, Minimum supports of eigenfunctions of graphs: a survey, On the Nullity of Altans and Iterated Altans, Unnamed Item, Unnamed Item, Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them, Spectral Radius of Graphs, The electron density function of the Hückel (tight-binding) model, Unnamed Item, Controllability of NEPSes of graphs, Unnamed Item, Regular and maximal graphs with prescribed tripartite graph as a star complement, Representing complex networks without connectivity via spectrum series, Matrix functions in network analysis, The closeness eigenvalues of graphs, The extremal spectral radius of generalized block graphs, Strong star complements in graphs, Co-eigenvector graphs, Calculating elements of matrix functions using divided differences, Finding singularly cospectral graphs, On the multiplicities of digraph eigenvalues, Spectral radius of graphs with given size and odd girth, On graphs with equal dominating and c-dominating energy, NEPS of complex unit gain graphs, On spectral properties for graph matching and graph isomorphism problems, The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis, Eigenvalue location in threshold graphs, A subdivision theorem for vertices not on internal paths, On the distance and distance signless Laplacian spectral radii of bicyclic graphs, The Main Eigenvalues of the Undirected Power Graph of a Group, Unnamed Item, Controllability of undirected graphs, On graphs with cut vertices and cut edges, $\mathcal F$-hypercyclic and disjoint $\mathcal F$-hypercyclic properties of binary relations over topological spaces, Weighted microscopic image reconstruction, On the discrete version of Picone's identity, On nut and core singular fullerenes, On the index of caterpillars, Ordering trees by their largest eigenvalues, Beyond non-backtracking: non-cycling network centrality measures, Variable neighborhood search for extremal graphs 3, On the spectral radius of graphs with a given domination number, On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\), On pseudo-distance-regularity, Constructing pairs of equienergetic and non-cospectral graphs, Unnamed Item, Unnamed Item, The spread of the spectrum of a graph, Some results on the index of unicyclic graphs, Graphs with least eigenvalue \(-2\): The star complement technique, Isospectral polygons, planar graphs and heat content, The dynamics of Schelling-type segregation models and a nonlinear graph Laplacian variational problem, Unnamed Item, The spectral radius of edge chromatic critical graphs, Unnamed Item, Spectra of Extended Double Cover Graphs, On graphs with exactly three Q-main eigenvalues, Bounds for the spectral radius and energy of extended adjacency matrix of graphs, Unnamed Item, On equiangular lines in $17$ dimensions and the characteristic polynomial of a Seidel matrix, Unnamed Item, Constructing families of cospectral regular graphs, Knowledge Graph Completion via Complex Tensor Factorization, Unbalanced unicyclic and bicyclic graphs with extremal spectral radius, The cycle (circuit) polynomial of a graph with double and triple weights of edges and cycles, On the Limiting Behavior of Parameter-Dependent Network Centrality Measures, On eigenvalues of the reciprocal distance signless Laplacian matrix of graphs, Some regular signed graphs with only two distinct eigenvalues, The Local Spectra of Line Graphs, On the spectrum of Cayley graphs related to the finite groups, Vertex-removal, vertex-addition and different notions of similarity for vertices of a graph, Some bounds on the A_α-index of connected graphs with fixed order and size, On the α-spectral radius of graphs, Ordering graphs with small index and its application, On dynamic network security: a random decentering algorithm on graphs, A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra, The many facets of the Estrada indices of graphs and networks, Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses, Maximal graphs with a prescribed complete bipartite graph as a star complement, Which non-regular bipartite integral graphs with maximum degree four do not have \(\pm 1\) as eigenvalues?, The necessity of conditions for graph quantum ergodicity and Cartesian products with an infinite graph, The anti-adjacency matrix of a graph: eccentricity matrix, Graph Laplacians, nodal domains, and hyperplane arrangements, Network properties of healthy and Alzheimer brains, Ordering starlike trees by the totality of their spectral moments, On Quipus whose signless Laplacian index does not exceed 4.5, On the largest eigenvalue of non-regular graphs, On singular signed graphs with nullspace spanned by a full vector: signed nut graphs, Applications of Estrada indices and energy to a family of compound graphs, On the exponential generating function for non-backtracking walks, The generalized microscopic image reconstruction problem, Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs, On the characterization of graphs by star complements, The spectrum of a class of uniform hypergraphs, On graphs with multiple eigenvalues, Distance spectral radius of trees with given number of segments, On the second minimum algebraic connectivity of the graphs whose complements are trees, The cost of segregation in (social) networks, Solutions for two conjectures on the eigenvalues of the eccentricity matrix, and beyond, Spectral norm of oriented graphs, Spectral ordering of trees with small index, Null decomposition of trees, On the least eigenvalue of cacti with pendant vertices, The maximal exceptional graphs, On the spectral radius of unicyclic graphs with perfect matchings, New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree, The devil is in the details: spectrum and eigenvalue distribution of the discrete Preisach memory model, Food webs robustness to biodiversity loss: the roles of connectance, expansibility and degree distribution, On graphs whose star complement for \(-2\) is a path or a cycle, Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph, The number of walks in a graph, Hoffman-type identities, Asymptotic results regarding the number of walks in a graph, The transfer matrices and the capacity of the 2-dimensional \((1, \infty)\)-runlength limited constraint, Balanced centrality of networks, Extremal spectral radius of graphs with rank 4, Minimum supports of functions on the Hamming graphs with spectral constraints, On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices, The main vertices of a star set and related graph parameters, On maximal entries in the principal eigenvector of graphs, On diagonal equations over finite fields via walks in NEPS of graphs, Unicyclic and bicyclic graphs with exactly three \(Q\)-main eigenvalues, On the largest and least eigenvalues of eccentricity matrix of trees, Equilibrium paths in discounted supergames, Welfare targeting in networks, On the \(\alpha\)-index of graphs with pendent paths, On the nullity of a connected graph in terms of order and maximum degree, The effect of a graft transformation on distance spectral radius, A geometrical characterization of strongly regular graphs, On the spectrum of an equitable quotient matrix and its application, Equilibrium existence and uniqueness in network games with additive preferences, On some properties of graph irregularity indices with a particular regard to the \(\sigma \)-index, The spectral radius of trees on \(k\) pendant vertices, On sums of graph eigenvalues, Spectral bounds and distance-regularity, Regular graphs with a prescribed complete multipartite graph as a star complement, On the distance signless Laplacian spectrum of graphs, On the largest eigenvalue of signed unicyclic graphs, There is no (75,32,10,16) strongly regular graph, On the expressive power of linear algebra on graphs, On graphs with prescribed star complements, On adjacency-distance spectral radius and spread of graphs, Slobodan Simić: an appreciation, Some new aspects of main eigenvalues of graphs, On the spectral radius of block graphs having all their blocks of the same size, On main eigenvalues of chain graphs, Extremal problems involving the two largest complementarity eigenvalues of a graph, The edge-connectivity of strongly 3-walk-regular graphs, On split graphs with four distinct eigenvalues, The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs, Equiangular lines in low dimensional Euclidean spaces, When can the components of NEPS of connected bipartite graphs be almost cospectral?, The spectral radius of graphs on surfaces, On the index of bicyclic graphs with perfect matchings, Spectra of graphs resulting from various graph operations and products: a survey, The maximum spectral radius of irregular bipartite graphs, An overview of \((\kappa, \tau)\)-regular sets and their applications, Families of nested graphs with compatible symmetric-group actions, Laplacian graph eigenvectors, Non-bipartite graphs of fixed order and size that minimize the least eigenvalue, Constructing fullerene graphs from their eigenvalues and angles, The complement of the path is determined by its spectrum, On the components of NEPS of connected bipartite graphs, The changes in indices of modified graphs, Some results on graph spectra, The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes, Star complements and switching in graphs, Polynomial reconstruction and terminal vertices, Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs, Maximal graphs and graphs with maximal spectral radius, Equitable switching and spectra of graphs, On minimum algebraic connectivity of graphs whose complements are bicyclic, Signed graphs whose spectrum is bounded by \(- 2\)