All-Path Convexity: Two Characterizations, General Position Number, And One Algorithm
Year:
2024Published in:
Discrete Mathematics LettersWe present two characterizations for the all-path convex sets in graphs. Using the first criterion, we obtain a new characterization of connected block graphs and compute the general position number in a graph with respect to the all-path convexity. The second criterion allows us to provide a new algorithm for testing a set on all-path convexity.
Related by author
12 publications found
Graphs With Odd And Even Distances Between Non‑Cut Vertices
Publisher: Opuscula Mathematica
Authors: Sergiy Kozerenko, Kateryna Antoshyna
On Strongly Connected Markov Graphs Of Maps On Combinatorial Trees
Publisher: Discrete Mathematics Letters
Authors: Sergiy Kozerenko
Unique Eccentric Point Graphs And Their Eccentric Digraphs
Publisher: Discrete Mathematics
Authors: Sergiy Kozerenko, Artem Hak, Vladyslav Haponenko, Andrii Serdiuk
Periods In XOR Parallel Dynamical Systems Over Directed Dependency Graphs
Publisher: Applied Mathematics and Computation
Authors: Sergiy Kozerenko, Jose C. Valverde
On Expansive And Anti‑Expansive Tree Maps
Publisher: Opuscula Mathematica
Authors: Sergiy Kozerenko
Dynamical Structure Of Metric And Linear Self‑Maps On Combinatorial Trees
Publisher: Discrete Mathematics Letters
Authors: Sergiy Kozerenko
An Optimal Lower Bound For The Size Of Periodic Digraphs
Publisher: Discrete Mathematics Letters
Authors: Sergiy Kozerenko
Markov Graphs Of One–Dimensional Dynamical Systems And Their Discrete Analogues
Publisher: Romanian Journal of Mathematics and Computer Science
Authors: Sergiy Kozerenko
On The Abstract Properties Of Markov Graphs For Maps On Trees
Publisher: Matematicki Bilten
Authors: Sergiy Kozerenko
Line Digraphs of Polytrees
Publisher: SSRN
Authors: Sergiy Kozerenko, Bohdan-Yarema Dekhtiar