Neighbor integrity of transformation graphs

DOI10.1142/S0129054113500056MaRDI QIDQ2856006zbMATH OpenFDO

Authors Goksen Bacak-Turan, Alpay Kirlangic

Publication date 23 October 2013

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054113500056

zbMATH Keywords

integrityneighbor integritytransformation graphsvulnerability

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18)

Recommendations

• Vulnerability in graphs: the neighbour-integrity of line graphs
• Neighbor rupture degree of transformation graphs \(G^{xy-}\)
• Integrity of total transformation graphs
• Vertex-neighbour-integrity of composition graphs of paths and cycles
• Vertex-neighbor-integrity of composition graph \(P_m[G]\)

Cites work

• Design of survivable communications networks under performance constraints
• Optimal K-secure graphs
• The transformation graph \(G^{xyz}\) when \(xyz=-++\)
• Transformation graph \(G^{-+-}\)

Cited in

(4)

• Vulnerability in graphs: the neighbour-integrity of line graphs
• The neighbour-integrity of boolean graphs and its compounds
• Integrity of total transformation graphs
• Neighbor rupture degree of transformation graphs \(G^{xy-}\)

This page was built for publication: Neighbor integrity of transformation graphs

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