Polynomial reconstruction of signed graphs

DOI10.1016/J.LAA.2016.03.036zbMATH Open1334.05056OpenAlexW2339187589MaRDI QIDQ273155FDOQ273155

Authors: Zoran Stanić, Slobodan K. Simić 

Publication date: 21 April 2016

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

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

Recommendations

• Notes on the polynomial reconstruction of signed graphs
• Polynomial reconstruction of signed graphs whose least eigenvalue is close to \(-2\)
• scientific article; zbMATH DE number 2028636
• On the reconstruction of the characteristic polynomial of a graph
• scientific article; zbMATH DE number 3954967
• scientific article; zbMATH DE number 3912429
• A Tutte polynomial for signed graphs
• Polynomial reconstruction and terminal vertices
• Partial-dual polynomials and signed intersection graphs
• Flow polynomials of a signed graph

zbMATH Keywords

eigenvaluessigned graphcharacteristic polynomialunicyclic graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph polynomials (05C31) Signed and weighted graphs (05C22) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• Polynomial reconstruction and terminal vertices
• On the reconstruction of the characteristic polynomial of a graph
• On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\)
• Seeking counterexamples to the reconstruction conjecture for the characteristic polynomial of graphs and a positive results
• Some notes on spectra of cographs.
• The polynomial reconstruction of unicyclic graphs is unique
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorial approach for computing the characteristic polynomial of a matrix

Cited In (8)

• Signed graphs with at most three eigenvalues
• Title not available (Why is that?)
• Title not available (Why is that?)
• Spectra of quaternion unit gain graphs
• Notes on the polynomial reconstruction of signed graphs
• Perturbations in a signed graph and its index
• The polynomial reconstruction problem: the first 50 years
• Lower bounds for the least Laplacian eigenvalue of unbalanced blocks

This page was built for publication: Polynomial reconstruction of signed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q273155)