Zobrazeno 1 - 10
of 268
pro vyhledávání: '"Chang, Gerard J."'
Publikováno v:
Graphs Combin. 32 (2016), 1731--1747
An edge Roman dominating function of a graph $G$ is a function $f\colon E(G) \rightarrow \{0,1,2\}$ satisfying the condition that every edge $e$ with $f(e)=0$ is adjacent to some edge $e'$ with $f(e')=2$. The edge Roman domination number of $G$, deno
Externí odkaz:
http://arxiv.org/abs/1405.5622
A locally connected spanning tree of a graph $G$ is a spanning tree $T$ of $G$ such that the set of all neighbors of $v$ in $T$ induces a connected subgraph of $G$ for every $v\in V(G)$. The purpose of this paper is to give linear-time algorithms for
Externí odkaz:
http://arxiv.org/abs/cs/0409013
In this paper, we study diagnosabilities of multiprocessor systems under two diagnosis models: the PMC model and the comparison model. In each model, we further consider two different diagnosis strategies: the precise diagnosis strategy proposed by P
Externí odkaz:
http://arxiv.org/abs/cs/0408022
Autor:
Chang, Gerard J.
This note gives a short proof on characterizations of a forest to be equitably k-colorable.
Comment: 5 pages
Comment: 5 pages
Externí odkaz:
http://arxiv.org/abs/math/0407235
Autor:
Pand, Jun-Jie, Chang, Gerard J.
An isometric path between two vertices in a graph G is a shortest path joining them. The isometric-path number of G, denoted by ip(G), is the minimum number of isometric paths required to cover all vertices of G. In this paper, we determine exact val
Externí odkaz:
http://arxiv.org/abs/math/0407168
Autor:
Pan, Jun-Jie, Chang, Gerard J.
An isometric path between two vertices in a graph $G$ is a shortest path joining them. The isometric path number of $G$, denoted by $\ip(G)$, is the minimum number of isometric paths needed to cover all vertices of $G$. In this paper, we determine ex
Externí odkaz:
http://arxiv.org/abs/math/0310332
Publikováno v:
In Discrete Mathematics 6 December 2015 338(12):2348-2355
Autor:
Lin, Wu-Hsiung, Chang, Gerard J.
Publikováno v:
In Discrete Applied Mathematics November 2013 161(16-17):2532-2536
Publikováno v:
In Discrete Applied Mathematics July 2013 161(10-11):1395-1401
Autor:
Lin, Wu-Hsiung, Chang, Gerard J.
Publikováno v:
In Discrete Applied Mathematics May 2013 161(7-8):1060-1066