Self-switching of union of two complete graphs

DOI10.56947/GJOM.V16I2.1880MaRDI QIDQ6549453zbMATH OpenFDO

Authors C. Jayasekaran, S. S. Athithiya

Publication date 3 June 2024

Published in Gulf Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.56947/GJOM.V16I2.1880

zbMATH Keywords

complete graphsswitchingunion of two complete graphs

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Characterization of disconnected two-cyclic graphs with a self vertex switching
• Self vertex switching of connected two-cyclic graphs
• scientific article; zbMATH DE number 6496937
• Self vertex switchings of disconnected unicyclic graphs.
• scientific article; zbMATH DE number 3912422

This page was built for publication: Self-switching of union of two complete graphs

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