AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (345.4 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline

Super Connected Kronecker Products of Paths, Cycles and Cycles

School of Mathematics and System Sciences, Xinjiang University, Urumqi Xinjiang 830017, China
Show Author Information

Abstract

A graph G is super connected, or simply super-κ, if every minimum vertex-cut isolates a vertex. The Kronecker product G1 × G2 of graphs G1 and G2 is the graph with vertex set V (G1 × G2) = V(G1) × V (G2) and edge set E(G1 × G2) = {(u1,v1)(u2,v2): u1u2 ∈ E(G1),v1v2 ∈ E(G2)}. In this paper, we prove that Pm × Cn is super-κ for m≥4, n≥3 and n is odd; Cm × Cn is super-κ for m≥5, n≥3 and n is odd.

CLC number: O157.5 Document code: A Article ID: 2096-7675(2022)02-0176-06

References

【1】
【1】
 
 
Journal of Xinjiang University(Natural Science Edition in Chinese and English)
Pages 176-181

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
WU L, TIAN Y. Super Connected Kronecker Products of Paths, Cycles and Cycles. Journal of Xinjiang University(Natural Science Edition in Chinese and English), 2022, 39(2): 176-181. https://doi.org/10.13568/j.cnki.651094.651316.2021.02.17.0001

549

Views

21

Downloads

0

Crossref

Received: 17 February 2021
Published: 01 March 2022
© 2022 Journal of Xinjiang University (Natural Science Edition in Chinese and English)