Zobrazeno 1 - 10
of 199
pro vyhledávání: '"Eddie Cheng"'
Publikováno v:
IEEE Access, Vol 8, Pp 175932-175947 (2020)
In a graph $G$ , two spanning trees $T_{1}$ and $T_{2}$ are rooted at the same vertex $r$ . If, for every $v \in V(G)$ , the paths from $v$ to the root $r$ in $T_{1}$ and $T_{2}$ are internally vertex-disjoint, they are called independent spanning tr
Externí odkaz:
https://doaj.org/article/5785170329de4ef6b7da764e7d65d3c4
Autor:
Mohamad Abdallah, Eddie Cheng
Publikováno v:
Theory and Applications of Graphs, Vol 8, Iss 1 (2021)
The strong matching preclusion is a measure for the robustness of interconnection networks in the presence of node and/or link failures. However, in the case of random link and/or node failures, it is unlikely to find all the faults incident and/or a
Externí odkaz:
https://doaj.org/article/279e939505ae43c793c8ed488c792641
Publikováno v:
Theory and Applications of Graphs, Vol 6, Iss 1, Pp 1-8 (2019)
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph with no perfect matchings. In this paper we determine the matching preclusion number for the generalized Peters
Externí odkaz:
https://doaj.org/article/9a86e03ee34f41f9a89ef066ba155749
Publikováno v:
Theory and Applications of Graphs, Vol 7, Iss 2 (2020)
An interconnection network's diagnosability is an important measure of its self-diagnostic capability. In 2012, Peng et al. proposed a measure for fault diagnosis of the network, namely, the $h$-good-neighbor conditional diagnosability, which require
Externí odkaz:
https://doaj.org/article/8ed83f9cebe24736a6c98f6939b0f3c9
Autor:
Mohamad Adballah, Eddie Cheng
Publikováno v:
Theory and Applications of Graphs, Vol 6, Iss 2 (2019)
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. Park and Ihm introduced the problem of strong matching pre
Externí odkaz:
https://doaj.org/article/0453b1449cd04866998dde7c56e7c5a5
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 21 no. 4, Iss Distributed Computing and... (2019)
The \emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. As a generalization, Liu and Liu recently introduced the concept of fra
Externí odkaz:
https://doaj.org/article/67afd1f5437d4ce9ae3d6d5914790db8
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 20 no. 2, Iss Graph Theory (2018)
For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the \emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $n$ and $k$ be two integers wit
Externí odkaz:
https://doaj.org/article/b238bed410dd4c058a6cc537646dedd2
Publikováno v:
Theory and Applications of Graphs, Vol 5, Iss 1 (2018)
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal such sets are precisely sets of e
Externí odkaz:
https://doaj.org/article/2628b70250f7492f9399b9f0609636d8
Autor:
Eddie Cheng, Serge Kruk
Publikováno v:
Journal of Systemics, Cybernetics and Informatics, Vol 4, Iss 3, Pp 74-78 (2006)
The class of (n,k)-star graphs and their unidirectional version were introduced as generalizations of star graphs and unidirectional star graphs respectively. In this paper, we substantially improved previously known bound for the the diameter of uni
Externí odkaz:
https://doaj.org/article/1f909801392848a89a3f9b2b1cf26cef
Publikováno v:
Discrete Applied Mathematics. 327:87-95