Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Opuscula Mathematica

1 2025

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: strong unique independence tree

Sortuj według:

Ogranicz wyniki do:

Graphs with odd and even distances between non-cut vertices

Antoshyna Kateryna, Kozerenko Sergiy

Opuscula Mathematica

2025

Vol. 45, no. 1

5--25

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.