Zobrazeno 1 - 10
of 361
pro vyhledávání: '"Levit, Vadim"'
Autor:
Levit, Vadim E., Mandrescu, Eugen
Let $\alpha(G)$ denote the cardinality of a maximum independent set and $\mu(G)$ be the size of a maximum matching of a graph $G=\left( V,E\right) $. If $\alpha(G)+\mu(G)=\left\vert V\right\vert $, then $G$ is a K\"{o}nig-Egerv\'{a}ry graph, and $G$
Externí odkaz:
http://arxiv.org/abs/2411.12863
Let $G$ be a $\mathbf{W}_{p}$ graph if $n\geq p$ and every $p$ pairwise disjoint independent sets of $G$ are contained within $p$ pairwise disjoint maximum independent sets. In this paper, we establish that every $\mathbf{W}_{p}$ graph $G$ is $p$-qua
Externí odkaz:
http://arxiv.org/abs/2409.00827
Autor:
Levit, Vadim E., Mandrescu, Eugen
Let $\alpha(G)$ denote the cardinality of a maximum independent set, while $\mu(G)$ be the size of a maximum matching in $G=\left( V,E\right) $. It is known that if $\alpha(G)+\mu(G)=\left\vert V\right\vert $, then $G$ is a K\"{o}nig-Egerv\'{a}ry gra
Externí odkaz:
http://arxiv.org/abs/2405.13176
Autor:
Levit, Vadim E., Tankus, David
A graph $G$ is well-covered if all maximal independent sets are of the same cardinality. Let $w:V(G) \longrightarrow\mathbb{R}$ be a weight function. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight. An edge $xy \in
Externí odkaz:
http://arxiv.org/abs/2403.14824
Autor:
Levit, Vadim E., Mandrescu, Eugen
The graph G=(V,E) is called Konig-Egervary if the sum of its independence number and its matching number equals its order. Let RV(G) denote the number of vertices v such that G-v is Konig-Egervary, and let RE(G) denote the number of edges e such that
Externí odkaz:
http://arxiv.org/abs/2401.05523
Autor:
Levit, Vadim E., Mandrescu, Eugen
Let $\alpha(G)$ denote the cardinality of a maximum independent set, while $\mu(G)$ be the size of a maximum matching in $G=\left( V,E\right) $. Let $\xi(G)$ denote the size of the intersection of all maximum independent sets. It is known that if $\a
Externí odkaz:
http://arxiv.org/abs/2308.03503
Autor:
Kadrawi, Ohr, Levit, Vadim E.
Given a graph $G$, the number of its vertices is represented by $n(G)$, while the number of its edges is denoted as $m(G)$. An independent set in a graph is a set of vertices where no two vertices are adjacent to each other and the size of the maximu
Externí odkaz:
http://arxiv.org/abs/2308.01685
Autor:
Levit, Vadim E., Tankus, David
Let $G$ be a graph. A set $S \subseteq V(G)$ is independent if its elements are pairwise non-adjacent. A vertex $v \in V(G)$ is shedding if for every independent set $S \subseteq V(G) \setminus N[v]$ there exists $u \in N(v)$ such that $S \cup \{u\}$
Externí odkaz:
http://arxiv.org/abs/2306.17272
Autor:
Kadrawi, Ohr, Levit, Vadim E.
An independent set in a graph is a collection of vertices that are not adjacent to each other. The cardinality of the largest independent set in $G$ is represented by $\alpha(G)$. The independence polynomial of a graph $G = (V, E)$ was introduced by
Externí odkaz:
http://arxiv.org/abs/2305.01784
Autor:
Levit, Vadim E., Mandrescu, Eugen
The independence number $\alpha(G)$ is the cardinality of a maximum independent set, while $\mu(G)$ is the size of a maximum matching in $G$. If $\alpha(G)+\mu(G)$ equals the order of $G$, then $G$ is called a Konig-Egervary graph. The number $d\left
Externí odkaz:
http://arxiv.org/abs/2209.00308