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

DOI10.1080/09720529.2015.1013679zbMATH Open1495.05124OpenAlexW1882663105MaRDI QIDQ5069732FDOQ5069732

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

• Signed graphs
• Algorithmic graph theory and perfect graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Common-edge sigraphs
• Line-coloring of signed graphs
• Characterization of common-edge sigraph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Connected graphs switching equivalent to their iterated line graphs

Cited In (1)

• Title not available (Why is that?)

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)