Zobrazeno 1 - 10
of 3 104
pro vyhledávání: '"West Douglas A"'
An edge-coloring of a graph $G$ assigns a color to each edge of $G$. An edge-coloring is a parity edge-coloring if for each path $P$ in $G$, it uses some color on an odd number of edges in $P$. It is a strong parity edge-coloring if for every open wa
Externí odkaz:
http://arxiv.org/abs/2411.11124
The $(n-\ell)$-deck of an $n$-vertex graph is the multiset of subgraphs obtained from it by deleting $\ell$ vertices. A family of $n$-vertex graphs is $\ell$-recognizable if every graph having the same $(n-\ell)$-deck as a graph in the family is also
Externí odkaz:
http://arxiv.org/abs/2308.04509
The $(n-\ell)$-deck of an $n$-vertex graph is the multiset of (unlabeled) subgraphs obtained from it by deleting $\ell$ vertices. An $n$-vertex graph is $\ell$-reconstructible if it is determined by its $(n-\ell)$-deck, meaning that no other graph ha
Externí odkaz:
http://arxiv.org/abs/2307.10035
Autor:
Qu, Zishen, West, Douglas B.
Given a nonnegative integer weight $f(v)$ for each vertex $v$ in a multigraph $G$, an {\it $f$-bounded subgraph} of $G$ is a multigraph $H$ contained in $G$ such that $d_H(v)\le f(v)$ for all $v\in V(G)$. Using Tutte's $f$-Factor Theorem, we give a n
Externí odkaz:
http://arxiv.org/abs/2307.01324
Autor:
Poxon, Judith L.
Publikováno v:
Buddhist-Christian Studies, 2001 Jan 01. 21, 140-144.
Externí odkaz:
https://www.jstor.org/stable/1390503
The \emph{eccentricity} of a vertex $u$ in a graph $G$, denoted by $e_G(u)$, is the maximum distance from $u$ to other vertices in $G$. We study extremal problems for the average eccentricity and the first and second Zagreb eccentricity indices, deno
Externí odkaz:
http://arxiv.org/abs/2304.11537
Autor:
Chejnová, Alena
Publikováno v:
Acta Universitatis Carolinae Philologica. (2):221-229
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=263085
We study the minimum number of maximum matchings in a bipartite multigraph G with parts $X$ and $Y$ under various conditions, refining the well-known lower bound due to M. Hall. When $|X|=n$, every vertex in $X$ has degree at least $k$, and every ver
Externí odkaz:
http://arxiv.org/abs/2211.10427
Autor:
West, Douglas B., Zhu, Xuding
A graph is $\ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\ell$ vertices. We prove that strongly regular graphs with at least six vertices are $2$-reconstructible.
Comment: 5 pages
Comment: 5 pages
Externí odkaz:
http://arxiv.org/abs/2210.11742
Publikováno v:
In Discrete Applied Mathematics 15 February 2025 362:109-123