Zobrazeno 1 - 10
of 398
pro vyhledávání: '"Chen Guantao"'
Autor:
Chen Guantao, Tura Fernando C.
Publikováno v:
Special Matrices, Vol 12, Iss 1, Pp 68-81 (2024)
In this article, we give an O(n)O\left(n) time and space algorithm for obtaining the Laplacian eigenvalues of a cograph. This approach is more efficient as there is no need to directly compute the eigenvalues of Laplacian matrix related to this class
Externí odkaz:
https://doaj.org/article/80b98df2fb1b4ba79edb311bafb83545
For a multigraph $G$, $\chi'(G)$ denotes the chromatic index of $G$, $\Delta(G)$ the maximum degree of $G$, and $\Gamma(G) = \max\left\{\left\lceil \frac{2|E(H)|}{|V(H)|-1} \right\rceil: H \subseteq G \text{ and } |V(H)| \text{ odd}\right\}$. As a ge
Externí odkaz:
http://arxiv.org/abs/2407.09403
The mean subtree order of a given graph $G$, denoted $\mu(G)$, is the average number of vertices in a subtree of $G$. Let $G$ be a connected graph. Chin, Gordon, MacPhee, and Vincent [J. Graph Theory, 89(4): 413-438, 2018] conjectured that if $H$ is
Externí odkaz:
http://arxiv.org/abs/2308.12808
Autor:
Chen, Guantao, Tura, Fernando C.
Publikováno v:
Special Matrices,2024
In this paper, we give a linear algorithm for obtaining the Laplacian eigenvalues of a cograph. This approach is more efficient as there is no need to directly compute the eigenvalues of Laplacian matrix related to this class of graph. As an applicat
Externí odkaz:
http://arxiv.org/abs/2306.10570
Autor:
Chen, Guantao, Shan, Songling
Let $G$ be a multigraph. A subset $F$ of $E(G)$ is an edge cover of $G$ if every vertex of $G$ is incident to an edge of $F$. The cover index, $\xi(G)$, is the largest number of edge covers into which the edges of $G$ can be partitioned. Clearly $\xi
Externí odkaz:
http://arxiv.org/abs/2304.06651
Let $G$ be a simple graph. Denote by $n$, $\Delta(G)$ and $\chi' (G)$ be the order, the maximum degree and the chromatic index of $G$, respectively. We call $G$ \emph{overfull} if $|E(G)|/\lfloor n/2\rfloor > \Delta(G)$, and {\it critical} if $\chi'(
Externí odkaz:
http://arxiv.org/abs/2208.04179
Publikováno v:
J. Graph Theory. 104 (2023) 360-371
A linear forest is a union of vertex-disjoint paths, and the linear arboricity of a graph $G$, denoted by $\operatorname{la}(G)$, is the minimum number of linear forests needed to partition the edge set of $G$. Clearly, $\operatorname{la}(G) \ge \lce
Externí odkaz:
http://arxiv.org/abs/2207.07169
Let $G$ be a graph with maximum degree $\Delta(G)$ and maximum multiplicity $\mu(G)$. Vizing and Gupta, independently, proved in the 1960s that the chromatic index of $G$ is at most $\Delta(G)+\mu(G)$. The distance between two edges $e$ and $f$ in $G
Externí odkaz:
http://arxiv.org/abs/2204.01074
Publikováno v:
In European Journal of Combinatorics December 2024 122
Publikováno v:
In Physiological and Molecular Plant Pathology March 2025 136