Recognizing signed line graphs with a single root

DOI10.2298/AADM250525019SMaRDI QIDQ6902140zbMATH OpenFDO

Authors Zoran Stanić

Publication date 11 November 2025

Published in Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/AADM250525019S

zbMATH Keywords

digonKrausz theoremsigned line graphswitching isomorphismWhitney theorem

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• Characterizations of derived graphs
• Characterizations of line graphs in signed and gain graphs
• Congruent graphs and the connectivity of graphs
• Edge-signed graphs with smallest eigenvalue greater than \(-2\)
• Generalized line graphs
• scientific article; zbMATH DE number 4168714 (Why is no real title available?)
• scientific article; zbMATH DE number 3102314 (Why is no real title available?)
• Line graphs, root systems, and elliptic geometry
• Matrices in the theory of signed simple graphs
• Signed graphs represented by \(D_{\infty}\)
• Signed line graphs with least eigenvalue -2: the star complement technique
• Spectra of signed graphs with two eigenvalues
• The interchange graph of a finite graph
• Total graph of a signed graph

Cited in

(2)

• A construction of cospectral signed line graphs
• A note on the Krausz theorem and the Whitney theorem for mixed line graphs.

This page was built for publication: Recognizing signed line graphs with a single root

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