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
21 publications found
Graphs With Odd And Even Distances Between Non‑Cut Vertices
Publisher: Opuscula Mathematica
Authors: Sergiy Kozerenko, Kateryna Antoshyna
Discrete Markov graphs: loops, fixed points and maps preordering
Publisher: Society for the Promotion of Science
Authors: Sergiy Kozerenko
On graphs with graphic imbalance sequences
Publisher: Київський національний університет імені Тараса Шевченка
Authors: Sergiy Kozerenko, Volodymyr Skochko
On Disjoint Union Of M‑Graphs
Publisher: Algebra and Discrete Mathematics
Authors: Sergiy Kozerenko
Edge Imbalance Sequences And Their Graphicness
Publisher: Journal of Advanced Mathematical Studies
Authors: Sergiy Kozerenko
On graphs with maximum size in their switching classes
Publisher: Charles University in Prague
Authors: Sergiy Kozerenko
On Markov graphs
Publisher: Київський національний університет імені Тараса Шевченка
Authors: Sergiy Kozerenko
Maps of combinatorial trees with weakly connected Markov graphs
Publisher: Utilitas Mathematica
Authors: Sergiy Kozerenko
Linear And Metric Maps On Trees Via Markov Graphs
Publisher: Commentationes Mathematicae Universitatis Carolinae
Authors: Sergiy Kozerenko
A Note On The Triameter Of Graphs
Publisher: Discrete Applied Mathematics
Authors: Sergiy Kozerenko, Artem Hak, Bohdana Oliynyk