On the Laplacian coefficients of signed graphs

From MaRDI portal
Publication:2347353


DOI10.1016/j.laa.2015.02.007zbMath1312.05078MaRDI QIDQ2347353

Francesco Belardo, Slobodan K. Simic

Publication date: 27 May 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2015.02.007


05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C22: Signed and weighted graphs


Related Items

Unnamed Item, Unnamed Item, On sign-symmetric signed graphs, Toward a Laplacian spectral determination of signed ∞-graphs, Total graph of a signed graph, Signed graphs with at most three eigenvalues, On the spectrum of some signed complete and complete bipartite graphs, Signed graphs with two eigenvalues and vertex degree five, Generalizing Kirchhoff laws for Signed Graphs, Open problems in the spectral theory of signed graphs, Connected signed graphs L-cospectral to signed ∞-graphs, Relation between the rank of a signed graph and the rank of its underlying graph, On graphs whose least eigenvalue is greater than –2, On signed graphs whose second largest Laplacian eigenvalue does not exceed 3, Restructured class of estimators for population mean using an auxiliary variable under simple random sampling scheme, A decomposition of signed graphs with two eigenvalues, On adjacency and Laplacian cospectral non-isomorphic signed graphs, Signed analogue of line graphs and their smallest eigenvalues, Signed graphs with strong anti-reciprocal eigenvalue property, Signed graphs with extremal least Laplacian eigenvalue, Signed line graphs with least eigenvalue -2: the star complement technique, On eigenspaces of some compound signed graphs, Oriented gain graphs, line graphs and eigenvalues, On the sum of Laplacian eigenvalues of a signed graph, A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients, More on spectral analysis of signed networks, Signed bicyclic graphs minimizing the least Laplacian eigenvalue, A remark on eigen values of signed graph, On signed graphs with just two distinct Laplacian eigenvalues, Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems, On the Kirchhoff index of a graph and the matchings of the subdivision, Spectra of signed graphs, Edge controllability of signed networks, Characterizations of line graphs in signed and gain graphs, On connected signed graphs with rank equal to girth, Edge coloring of signed graphs, The average Laplacian polynomial of a graph, Gain-line graphs via \(G\)-phases and group representations, The main eigenvalues of signed graphs, Spectra of quaternion unit gain graphs, Spectra of signed graphs with two eigenvalues, On regular signed graphs with three eigenvalues, Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals, Edge perturbation on signed graphs with clusters: adjacency and Laplacian eigenvalues, On the normalized Laplacian permanental polynomial of a graph, Spectral characterizations of signed lollipop graphs, Bounds for the matching number and cyclomatic number of a signed graph in terms of rank, Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications, Correction to: ``Restructured class of estimators for population mean using an auxiliary variable under simple random sampling scheme. A remark on normalized Laplacian eigenvalues of signed graph, Polynomial reconstruction of signed graphs whose least eigenvalue is close to -2, Unnamed Item



Cites Work