Three multiply connected Kn-residual graphs
The $ {K_n}\textrm{ - } $ residual graph was proposed by P. Erdös, F. Harary and M. Klaw. They also proposed conclusions and conjectures regarding connected $ m - {K_n}\textrm{ - } $ residual graphs. When $ m = 1 $ , $ n \ne 1,2,3,4 $ , the authors proved that $ {K_{n + 1}} \times {K_2} $ is the onl...
Main Authors: | Kai Xu, Huiming Duan, Shihui Yang |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2020-01-01
|
Series: | Journal of Taibah University for Science |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/16583655.2020.1858603 |
Similar Items
-
The search for minimal edge 1-extension of an undirected colored graph
by: Razumovsky, Peter Vladimirovich
Published: (2021-08-01) -
ALGORITHMS OF COMPARATIVE ANALYSIS OF TWO INVARIANTS OF A GRAPH
by: Boris F. Melnikov, et al.
Published: (2019-04-01) -
An Efficient Subgraph Isomorphism Solver for Large Graphs
by: Zubair Ali Ansari, et al.
Published: (2021-01-01) -
Some Studies in Neutrosophic Graphs
by: Nasir Shah
Published: (2016-08-01) -
Marking Vertices to Find Graph Isomorphism Mapping Based on Continuous-Time Quantum Walk
by: Xin Wang, et al.
Published: (2018-08-01)