Graphs with odd and even distances between non-cut vertices
Opuscula Mathematica · 2025 · 5-25
DOI: 10.7494/opmath.2025.45.1.5 ↗Kurz gefasst
Fachartikel in der Zeitschrift Opuscula Mathematica, 2025. Verfasst von Kateryna Antoshyna und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 10 Literaturangaben.
Abstract (Originalsprache)
We prove that in a connected graph, the distances between non-cut vertices are odd if and only if it is the line graph of a strong unique independence tree. We then show that any such tree can be inductively constructed from stars using a simple operation. Further, we study the connected graphs in which the distances between non-cut vertices are even (shortly, NCE-graphs). Our main results on NCE-graphs are the following: we give a criterion of NCE-graphs, show that any bipartite graph is an induced subgraph of an NCE-graph, characterize NCE-graphs with exactly two leaves, characterize graphs that can be subdivided to NCE-graphs, and provide a characterization for NCE-graphs which are maximal with respect to the edge addition operation.
Zitieren
APA
Antoshyna, K., & Kozerenko, S. (2025). Graphs with odd and even distances between non-cut vertices. Opuscula Mathematica, 5-25. https://doi.org/10.7494/opmath.2025.45.1.5
Vancouver
Antoshyna K, Kozerenko S. Graphs with odd and even distances between non-cut vertices. Opuscula Mathematica. 2025:5-25. doi:10.7494/opmath.2025.45.1.5
BibTeX
@article{Antoshyna2025,
author = {Antoshyna, Kateryna and Kozerenko, Sergiy},
title = {Graphs with odd and even distances between non-cut vertices},
journal = {Opuscula Mathematica},
year = {2025},
pages = {5--25},
doi = {10.7494/opmath.2025.45.1.5}
}
EUVIMED