Please use this identifier to cite or link to this item:
http://digitalrepository.fccollege.edu.pk/handle/123456789/1509
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Akbari, S. | - |
dc.contributor.author | Ghorbanb, S. Hossein | - |
dc.contributor.author | Malik, Shabnam | - |
dc.contributor.author | Qajara, S | - |
dc.date.accessioned | 2022-04-21T07:08:27Z | - |
dc.date.available | 2022-04-21T07:08:27Z | - |
dc.date.issued | 2019 | - |
dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/1509 | - |
dc.description.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. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Toeplitz graph, Regular graph, Cut-edge, Cut-vertex, 2-edge-connected graph | en_US |
dc.title | Conditions for regularity and for 2-connectivity of Toeplitz graphs | en_US |
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 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.