1-(edge-)trail-connected square tree. (17th February 2022)

• Record Type: Journal Article
• Authors: Xu, Lulu; Liu, Juan; Yang, Hong
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 25:Number 2(2022)
• Page Start: 559
• Page End: 578
• Publication Date: 2022-02-17
• Subjects: 05C05; Square graph -- Trail-connected -- S-trail-connected -- S-edge-trail-connected; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2020.1743504
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: A graph G is s -Hamiltonian-connected if the deletion of any vertex subset with at most s vertices results in a Hamiltonian-connected graph. In this paper, for positive integer s, a graph G is s -trail-connected if for any vertex subset X with | X |≤ s, G − X is trail-connected; a graph G is s -edge-trail-connected if for any edge subset Y with| Y |≤ s, G \ Y is trailconnected. The main purpose of this paper is to depict the structure of 1-trail-connected and 1-edge-trail-connected square tree.