Spectral characterizations of signed lollipop graphs

DOI10.1016/j.laa.2015.04.022zbMath1315.05083OpenAlexW327974249MaRDI QIDQ2348939

Paweł Petecki, Francesco Belardo

Publication date: 16 June 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.04.022

zbMATH Keywords

adjacency matrixLaplacian matrixspectral determinationsigned lollipop graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Related Items (34)

The $ k $-${rm bf{ th}}$ spectral moment of signed complete graphs ⋮ On cospectral oriented graphs and cospectral signed graphs ⋮ Unnamed Item ⋮ Signed graphs cospectral with the path ⋮ Spectral characterizations of signed cycles ⋮ On cospectrality of gain graphs ⋮ Perturbations in a signed graph and its index ⋮ On the sum of Laplacian eigenvalues of a signed graph ⋮ Laplacian spectral characterization of roses ⋮ Unnamed Item ⋮ Bounds for the matching number and cyclomatic number of a signed graph in terms of rank ⋮ Signed graphs with all but two eigenvalues equal to \(\pm 1\) ⋮ A switching method for constructing cospectral gain graphs ⋮ Minimizing the least eigenvalue of unbalanced signed unicyclic graphs with given girth or pendant vertices ⋮ On the eigenvalues of signed complete graphs ⋮ The main eigenvalues of signed graphs ⋮ Locating eigenvalues of unbalanced unicyclic signed graphs ⋮ Spectra of quaternion unit gain graphs ⋮ On signed graphs whose second largest Laplacian eigenvalue does not exceed 3 ⋮ Mixed paths and cycles determined by their spectrum ⋮ Signed bicyclic graphs minimizing the least Laplacian eigenvalue ⋮ Integral signed subcubic graphs ⋮ On the multiplicity of \(\alpha\) as an \(A_\alpha(\varGamma)\)-eigenvalue of signed graphs with pendant vertices ⋮ Connected signed graphs L-cospectral to signed ∞-graphs ⋮ Relation between the rank of a signed graph and the rank of its underlying graph ⋮ Spectra of signed graphs ⋮ Edge perturbation on signed graphs with clusters: adjacency and Laplacian eigenvalues ⋮ Signed complete graphs with exactly \(m\) non-negative eigenvalues ⋮ Maximizing the largest eigenvalues of signed unicyclic graphs ⋮ Unnamed Item ⋮ On signed graphs with two distinct eigenvalues ⋮ Toward a Laplacian spectral determination of signed ∞-graphs ⋮ SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL ⋮ Signed graphs with extremal least Laplacian eigenvalue

Cites Work

• Unnamed Item
• On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs
• The Laplacian spectrum of a mixed graph
• Combinatorial approach for computing the characteristic polynomial of a matrix
• Characterization of a signed graph whose signed line graph is \(S\)-consistent
• A note on the spectral characterization of dumbbell graphs
• Signless Laplacians of finite graphs
• Spectral characterizations of lollipop graphs
• Erratum to ``The lollipop graph is determined by its \(Q\)-spectrum
• A conjecture on the algebraic connectivity of connected graphs with fixed girth
• The lollipop graph is determined by its spectrum
• The lollipop graph is determined by its \(Q\)-spectrum
• Signed graphs
• A mathematical bibliography of signed and gain graphs and allied areas
• Glossary of signed and gain graphs and allied areas
• Largest eigenvalue of a unicyclic mixed graphs
• On the Laplacian coefficients of signed graphs
• Spectral characterizations of dumbbell graphs
• Signless Laplacian spectral characterization of line graphs ofT-shape trees
• Matrices in the Theory of Signed Simple Graphs
• Eigenvalue bounds for the signless laplacian
• Spectral criterion for cycle balance in networks
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• On the Laplacian Eigenvalues of Signed Graphs
• On signed graphs whose second largest Laplacian eigenvalue does not exceed 3

This page was built for publication: Spectral characterizations of signed lollipop graphs