Unique eccentric point graphs and their eccentric digraphs

dc.contributor.authorHak, Artem
dc.contributor.authorHaponenko, Vladyslav
dc.contributor.authorKozerenko, Sergiy
dc.contributor.authorSerdiuk, Andrii
dc.date.accessioned2023-10-06T07:26:26Z
dc.date.available2023-10-06T07:26:26Z
dc.date.issued2023
dc.description.abstractWe study graph-theoretic properties of eccentric digraphs of unique eccentric point graphs (shortly, uep-graphs). The latter are the connected graphs in which every vertex has a unique eccentric vertex. In particular, we characterize uep-graphs and the corresponding eccentric digraphs in the following classes: self-centered graphs having the number of vertices twice as diameter, block graphs, and graphs with diameter three. Also, we obtain non-trivial properties of weak components in eccentric digraphs of uep-graphs with diameter four and pose several open questions in this direction.en_US
dc.identifier.citationUnique eccentric point graphs and their eccentric digraphs / Artem Hak, Vladyslav Haponenko, Sergiy Kozerenko, Andrii Serdiuk // Discrete Mathematics. - 2023. - Vol. 346, Issue 12. - Article number 113614. - https://doi.org/10.1016/j.disc.2023.113614en_US
dc.identifier.issn0012-365X
dc.identifier.urihttps://doi.org/10.1016/j.disc.2023.113614
dc.identifier.urihttps://ekmair.ukma.edu.ua/handle/123456789/26330
dc.language.isoenen_US
dc.relation.sourceDiscrete Mathematicsen_US
dc.statusfirst publisheduk_UA
dc.subjectunique eccentric point graphen_US
dc.subjecteccentric digraphen_US
dc.subjecteccentricity of a vertexen_US
dc.subjectblock graphen_US
dc.subjectarticleen_US
dc.titleUnique eccentric point graphs and their eccentric digraphsen_US
dc.typeArticleuk_UA
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Unique_eccentric_point_graphs_and_their_eccentric_digraphs.pdf
Size:
419.03 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: