Zobrazeno 1 - 10
of 317
pro vyhledávání: '"Mitre, C"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 25:2, Graph Theory (March 22, 2024) dmtcs:11423
In this corrigendum, we give a counterexample to Theorem 5.2 in "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]. We also present a polynomial-time algorithm for computing the monophonic rank of a starlike graph
Externí odkaz:
http://arxiv.org/abs/2305.19277
In this paper, we study two graph convexity parameters: iteration time and general position number. The iteration time was defined in 1981 in the geodesic convexity, but its computational complexity was so far open. The general position number was de
Externí odkaz:
http://arxiv.org/abs/2305.00467
A walk $u_0u_1 \ldots u_{k-1}u_k$ of a graph $G$ is a \textit{weakly toll walk} if $u_0u_k \not\in E(G)$, $u_0u_i \in E(G)$ implies $u_i = u_1$, and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. The {\em weakly toll interval} of a set $S \subseteq V(G)$, d
Externí odkaz:
http://arxiv.org/abs/2303.07414
Autor:
Dourado, Mitre C., Oliveira, Rodolfo A., Ponciano, Vitor, Queiróz, Alessandra B., Silva, Rômulo L. O.
Given a graph $G$ such that each vertex $v_i$ has a value $f(v_i)$, the expanded-clique graph $H$ is the graph where each vertex $v_i$ of $G$ becomes a clique $V_i$ of size $f(v_i)$ and for each edge $v_iv_j \in E(G)$, there is a vertex of $V_i$ adja
Externí odkaz:
http://arxiv.org/abs/2208.03411
Let $G$ be a graph having a vertex $v$ such that $H = G - v$ is a trivially perfect graph. We give a polynomial-time algorithm for the problem of deciding whether it is possible to add at most $k$ edges to $G$ to obtain a trivially perfect graph. Thi
Externí odkaz:
http://arxiv.org/abs/2204.06842
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 26:2, Graph Theory (April 18, 2024) dmtcs:9837
A walk $u_0u_1 \ldots u_{k-1}u_k$ is a \textit{weakly toll walk} if $u_0u_i \in E(G)$ implies $u_i = u_1$ and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. A set $S$ of vertices of $G$ is {\it weakly toll convex} if for any two non-adjacent vertices $x,y \
Externí odkaz:
http://arxiv.org/abs/2203.17056
Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey results on chara
Externí odkaz:
http://arxiv.org/abs/2203.15878
Publikováno v:
In Applied Mathematics and Computation 15 February 2025 487
Publikováno v:
In Discrete Applied Mathematics 15 January 2025 360:246-257
A family of sets is $(p,q)$-intersecting if every nonempty subfamily of $p$ or fewer sets has at least $q$ elements in its total intersection. A family of sets has the $(p,q)$-Helly property if every nonempty $(p,q)$-intersecting subfamily has total
Externí odkaz:
http://arxiv.org/abs/2201.12610