Lupa

Show document Help

A- | A+ | Print
Title:Primitive, edge-short, isometric, and pantochordal cycles
Authors:ID Guzman, Gover E. C. (Author)
ID González Laffitte, Marcos E. (Author)
ID Fujita, André (Author)
ID Stadler, Peter F. (Author)
Files:.pdf ADAM_Guzman,Gonzalez_Laffitte,Fujita,Stadler_2025.pdf (478,50 KB)
MD5: 2B073C0A892AABAD0C651205E400BCE3
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:ZUP - University of Primorska Press
Abstract:A cycle in a graph G is said to be primitive from its vertex x if at least one of its edges does not belong to any shorter cycle that passes through x. This type of cycle and an associated notion of extended neighborhoods play a key role in message-passing algorithms that compute spectral properties of graphs with short loops. Here, we investigate such primitive cycles and graphs without long primitive cycles in a more traditional graph-theoretic framework. We show that a cycle is primitive from all its vertices if and only if it is isometric. We call a cycle fully redundant cycles if it is not primitive from any of its vertices and show that fully redundant cycles, in particular, are not edge short, i.e., they cannot be represented as the edge-disjoint union of a single edge and two shortest paths in G. The families Rk and Lk of graphs with all cycles of length at least k + 1 being fully redundant and not edge-short, respectively, coincide for k = 3 and k = 4. In these graphs, all cycles of length at least k + 1 are pantochordal, i.e., each of their vertices is incident with a chord. None of these results generalizes to k ≥ 5. Moreover, R₃ = L₃ turn out to be the block graphs, and R₄ = L₄ are the graphs with complete multi-partite blocks. The cographs, finally, are shown to form a proper subset of R₅.
Keywords:edge-short cycle, chord, block-graph, complete multipartite graph, wheel graphs, cographs, geodesic cycles, Hamiltonian cycles
Publication status:Published
Publication version:Version of Record
Publication date:10.03.2025
Publisher:Založba Univerze na Primorskem
Year of publishing:2025
Number of pages:19 str.
Numbering:Vol. 8, no. 2, [article no.] P2.01
PID:20.500.12556/RUP-22064 This link opens in a new window
UDC:51
eISSN:2590-9770
DOI:10.26493/2590-9770.1754.cd0 This link opens in a new window
Publication date in RUP:03.11.2025
Views:122
Downloads:0
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:The Art of Discrete and Applied Mathematics
Publisher:Založba Univerze na Primorskem
ISSN:2590-9770

Document is financed by a project

Funder:FAPESP
Project number:2018/21934-5

Funder:FAPESP
Project number:2019/22845-9

Funder:FAPESP
Project number:2020/08343-8

Funder:CNP
Project number:306811/2022-7

Funder:German Academic Exchange Service
Project number:57598588

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Title:Primitivni, povezavno kratki, izometrični in pantokordalni cikli
Keywords:povezavno kratek cikel, tetiva, blokovski graf, polni veˇcdelni graf, kolesni grafi, kografi, geodetski cikli, Hamiltonovi cikli


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica