Graphs with odd and even distances between non-cut vertices
dc.contributor.author | Antoshyna, Kateryna | en_US |
dc.contributor.author | Kozerenko, Sergiy | |
dc.date.accessioned | 2025-03-12T12:59:26Z | |
dc.date.available | 2025-03-12T12:59:26Z | |
dc.date.issued | 2025 | |
dc.description.abstract | 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. | en_US |
dc.identifier.citation | Antoshyna K. Graphs with odd and even distances between non-cut vertices / Kateryna Antoshyna, Sergiy Kozerenko // Opuscula Mathematica. - 2025. - Vol. 45, Issue 1. - P. 5-25. - https://doi.org/10.7494/OpMath.2025.45.1.5 | en_US |
dc.identifier.issn | 1232−9274 | |
dc.identifier.issn | 2300−6919 | |
dc.identifier.uri | https://doi.org/10.7494/OpMath.2025.45.1.5 | |
dc.identifier.uri | https://ekmair.ukma.edu.ua/handle/123456789/33918 | |
dc.language.iso | en | en_US |
dc.relation.source | Opuscula Mathematica | en_US |
dc.status | first published | en_US |
dc.subject | non-cut vertex | en_US |
dc.subject | graph distance | en_US |
dc.subject | line graph | en_US |
dc.subject | block | en_US |
dc.subject | strong unique independence tree | en_US |
dc.subject | article | en_US |
dc.title | Graphs with odd and even distances between non-cut vertices | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Antoshyna_Kozerenko_Graphs_with_odd_and_even_distances_between_non-cut_vertices.pdf
- Size:
- 521.4 KB
- Format:
- Adobe Portable Document Format
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: