Academic Journal
On (r,c)-constant, planar and circulant graphs
| Title: | On (r,c)-constant, planar and circulant graphs |
|---|---|
| Authors: | Caro, Yair, Mifsud, Xandru |
| Publisher Information: | Uniwersytet Zielonogorski * Wydzial Matematyki, Informatyli i Ekonometrii,Technical University Zielona Gora, Institute of Mathematics |
| Publication Year: | 2025 |
| Collection: | University of Malta: OAR@UM / L-Università ta' Malta |
| Subject Terms: | Graph theory, Mathematics -- Charts, diagrams, etc, Graph algorithms, Combinatorial analysis, Mathematical statistics -- Data processing |
| Description: | This paper concerns (r, c)-constant graphs, which are r-regular graphs in which the subgraph induced by the open neighbourhood of every vertex has precisely c edges. The family of (r, c)-graphs contains vertex-transitive graphs (and in particular Cayley graphs), graphs with constant link (sometimes called locally isomorphic graphs), (r, b)-regular graphs, strongly regular graphs, and much more. This family was recently introduced in [6], serving as an important tool in constructing flip graphs [6, 14]. In this paper we shall mainly deals with the following. (i) Existence and non-existence of (r, c)-planar graphs. We completely determine the cases of existence and non-existence of such graphs and supply the smallest order in the case when they exist. (ii) We consider the existence of (r, c)-circulant graphs. We prove that for c ≡ 2 (mod 3) no (r, c)-circulant graph exists and that for c ≡ 0, 1 (mod 3), c > 0 and r ≥ 6 + √8c−5/3 there exist (r, c)-circulant graphs. Moreover for c = 0 and r ≥ 1, (r, 0)-circulants exist. (iii) We consider the existence and non-existence of small (r, c)-constant graphs, supplying a complete table of the smallest order of graphs we found for 0 ≤ c ≤ C(r, 2) and r ≤ 6. We shall also determine all the cases in this range for which (r, c)-constant graphs do not exist. We establish a public database of (r, c)-constant graphs for varying r, c and order. ; peer-reviewed |
| Document Type: | article in journal/newspaper |
| Language: | English |
| Relation: | https://www.um.edu.mt/library/oar/handle/123456789/140903 |
| DOI: | 10.7151/dmgt.2551 |
| Availability: | https://www.um.edu.mt/library/oar/handle/123456789/140903 https://doi.org/10.7151/dmgt.2551 |
| Rights: | info:eu-repo/semantics/openAccess ; The copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder. |
| Accession Number: | edsbas.5AFB86A5 |
| Database: | BASE |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://www.um.edu.mt/library/oar/handle/123456789/140903# Name: EDS - BASE (ns324271) Category: fullText Text: View record from BASE |
|---|---|
| Header | DbId: edsbas DbLabel: BASE An: edsbas.5AFB86A5 RelevancyScore: 978 AccessLevel: 3 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 977.8095703125 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: On (r,c)-constant, planar and circulant graphs – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Caro%2C+Yair%22">Caro, Yair</searchLink><br /><searchLink fieldCode="AR" term="%22Mifsud%2C+Xandru%22">Mifsud, Xandru</searchLink> – Name: Publisher Label: Publisher Information Group: PubInfo Data: Uniwersytet Zielonogorski * Wydzial Matematyki, Informatyli i Ekonometrii,Technical University Zielona Gora, Institute of Mathematics – Name: DatePubCY Label: Publication Year Group: Date Data: 2025 – Name: Subset Label: Collection Group: HoldingsInfo Data: University of Malta: OAR@UM / L-Università ta' Malta – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematics+--+Charts%22">Mathematics -- Charts</searchLink><br /><searchLink fieldCode="DE" term="%22diagrams%22">diagrams</searchLink><br /><searchLink fieldCode="DE" term="%22etc%22">etc</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+algorithms%22">Graph algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Combinatorial+analysis%22">Combinatorial analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+statistics+--+Data+processing%22">Mathematical statistics -- Data processing</searchLink> – Name: Abstract Label: Description Group: Ab Data: This paper concerns (r, c)-constant graphs, which are r-regular graphs in which the subgraph induced by the open neighbourhood of every vertex has precisely c edges. The family of (r, c)-graphs contains vertex-transitive graphs (and in particular Cayley graphs), graphs with constant link (sometimes called locally isomorphic graphs), (r, b)-regular graphs, strongly regular graphs, and much more. This family was recently introduced in [6], serving as an important tool in constructing flip graphs [6, 14]. In this paper we shall mainly deals with the following. (i) Existence and non-existence of (r, c)-planar graphs. We completely determine the cases of existence and non-existence of such graphs and supply the smallest order in the case when they exist. (ii) We consider the existence of (r, c)-circulant graphs. We prove that for c ≡ 2 (mod 3) no (r, c)-circulant graph exists and that for c ≡ 0, 1 (mod 3), c > 0 and r ≥ 6 + √8c−5/3 there exist (r, c)-circulant graphs. Moreover for c = 0 and r ≥ 1, (r, 0)-circulants exist. (iii) We consider the existence and non-existence of small (r, c)-constant graphs, supplying a complete table of the smallest order of graphs we found for 0 ≤ c ≤ C(r, 2) and r ≤ 6. We shall also determine all the cases in this range for which (r, c)-constant graphs do not exist. We establish a public database of (r, c)-constant graphs for varying r, c and order. ; peer-reviewed – Name: TypeDocument Label: Document Type Group: TypDoc Data: article in journal/newspaper – Name: Language Label: Language Group: Lang Data: English – Name: NoteTitleSource Label: Relation Group: SrcInfo Data: https://www.um.edu.mt/library/oar/handle/123456789/140903 – Name: DOI Label: DOI Group: ID Data: 10.7151/dmgt.2551 – Name: URL Label: Availability Group: URL Data: https://www.um.edu.mt/library/oar/handle/123456789/140903<br />https://doi.org/10.7151/dmgt.2551 – Name: Copyright Label: Rights Group: Cpyrght Data: info:eu-repo/semantics/openAccess ; The copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder. – Name: AN Label: Accession Number Group: ID Data: edsbas.5AFB86A5 |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.5AFB86A5 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.7151/dmgt.2551 Languages: – Text: English Subjects: – SubjectFull: Graph theory Type: general – SubjectFull: Mathematics -- Charts Type: general – SubjectFull: diagrams Type: general – SubjectFull: etc Type: general – SubjectFull: Graph algorithms Type: general – SubjectFull: Combinatorial analysis Type: general – SubjectFull: Mathematical statistics -- Data processing Type: general Titles: – TitleFull: On (r,c)-constant, planar and circulant graphs Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Caro, Yair – PersonEntity: Name: NameFull: Mifsud, Xandru IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2025 Identifiers: – Type: issn-locals Value: edsbas – Type: issn-locals Value: edsbas.oa |
| ResultId | 1 |