Conditions for regularity and for 2-connectivity of Toeplitz graphs

Please use this identifier to cite or link to this item: http://digitalrepository.fccollege.edu.pk/handle/123456789/1509

Title:	Conditions for regularity and for 2-connectivity of Toeplitz graphs
Authors:	Akbari, S. Ghorbanb, S. Hossein Malik, Shabnam Qajara, S
Keywords:	Toeplitz graph, Regular graph, Cut-edge, Cut-vertex, 2-edge-connected graph
Issue Date:	2019
Abstract:	Let 1 t1 < t2 < < tk n. A Toeplitz graph G = (V;E) denoted by Tnht1; : : : ; tki is a graph where V = f1; : : : ; ng and E = f(i; j) j ji 􀀀 jj 2 ft1; : : : ; tkgg. In this paper, we classify all regular Toeplitz graphs. Here, we present some conditions under which a Toeplitz graph has no cut-edge and cut-vertex.
URI:	http://localhost:8080/xmlui/handle/123456789/1509
Appears in Collections:	Mathematics Department

Files in This Item:

File	Description	Size	Format
7-Utilitas Mathematica 110 (2019), 305-314.pdf		343.19 kB	Adobe PDF	View/Open

DSpace JSPUI