Characterization of common-edge sigraph
From MaRDI portal
Publication:385160
DOI10.1016/J.DAM.2012.10.013zbMATH Open1277.05080OpenAlexW1967221265MaRDI QIDQ385160FDOQ385160
Authors: Deepa Sinha, Somya Upadhyaya, Priya Kataria
Publication date: 29 November 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.10.013
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Isomorphisms of \(P_{k}\)-graphs for \(k \geqslant 4\)
- Edge-connectivity in \(P_k\)-path graphs
- Common-edge sigraphs
- On the characterization of path graphs
- Path graphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- An algorithm to detect \(S\)-consistency in line sigraph
- Unitary Addition Cayley Ring Signed Graphs *
- Common-edge signed graph of a signed graph
- Common-edge sigraphs
- An Algorithmic Characterization of sigraphs whose second iterated line sigraphs and common-edge sigraphs are switching equivalent
- Encryption and decryption of signed graph matrices through RSA algorithm
This page was built for publication: Characterization of common-edge sigraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385160)