An Algorithmic Characterization of sigraphs whose second iterated line sigraphs and common-edge sigraphs are switching equivalent

DOI10.1080/09720529.2015.1013679MaRDI QIDQ5069732zbMATH OpenOpenAlexFDO

Authors Deepa Sinha, Anshu Sethi

Publication date 19 April 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2015.1013679

zbMATH Keywords

switchingcommon-edge sigraphiterated line sigraphsigraphline sigraphnegative section

Mathematics Subject Classification ID

Signed and weighted graphs (05C22)

Cites work

• scientific article; zbMATH DE number 3855169 (Why is no real title available?)
• scientific article; zbMATH DE number 3767714 (Why is no real title available?)
• scientific article; zbMATH DE number 3596873 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Algorithmic graph theory and perfect graphs
• Characterization of common-edge sigraph
• Common-edge sigraphs
• Connected graphs switching equivalent to their iterated line graphs
• Line-coloring of signed graphs
• Signed graphs

Cited in

(1)

• scientific article; zbMATH DE number 3841914 (Why is no real title available?)

This page was built for publication: An Algorithmic Characterization of sigraphs whose second iterated line sigraphs and common-edge sigraphs are switching equivalent

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