Li-Da Tong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Li-Da Tong has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
Ting-Pang Chang
3 shared publicationsHao-Yu Yang
National Sun Yat-Sen University
2 shared publications- Ko-Wei Lih
Academia Sinica
2 shared publications André Raspaud
LaBRI U.M.R. 5800, Université Bordeaux I, 351 Cours de la Libération, F33405 Talence Cedex, France
1 shared publication- Chen-Ying Lin1 shared publication
- Gerard Jennhwa Chang
Department of Mathematics National Taiwan University 10617 Taipei Taiwan
1 shared publication
Latest Publications
- 22 February 2021
- Published by Springer Nature in Order
- Vol. 38 (3) , 515-525
On Properly Ordered Coloring of Vertices in a Vertex-Weighted Graph
- 22 February 2021
- Published by Springer Nature in Order
- Vol. 38 (3) , 515-525
On Properly Ordered Coloring of Vertices in a Vertex-Weighted Graph
- 9 April 2019
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 35 (4) , 827-836
Hamiltonian Spectra of Graphs
- 9 April 2019
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 35 (4) , 827-836
Hamiltonian Spectra of Graphs
- 24 May 2017
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 34 (4) , 1210-1217
Hamiltonian numbers in oriented graphs
- 24 May 2017
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 34 (4) , 1210-1217
Hamiltonian numbers in oriented graphs
- 1 April 2014
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 167, 61-71
Choice identification of a graph
- 1 April 2014
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 167, 61-71
Choice identification of a graph
- 30 June 2012
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 160 (9) , 1385-1389
The minimum identifying code graphs
- 30 June 2012
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 160 (9) , 1385-1389
The minimum identifying code graphs
- 22 June 2012
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 25 (4) , 694-701
The hamiltonian numbers in digraphs
- 22 June 2012
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 25 (4) , 694-701
The hamiltonian numbers in digraphs
- Open Access
When is the Direct Product of Generalized Mycielskians a Cover Graph?
A graph is said to be a cover graph if it is the underlying graph of the Hasse diagram of a finite partially ordered set. The direct product G X H of graphs G and H is the graph having vertex set V(G) X V(H) and edge set E(G X H) = {(g_i,h_s)(g_j,h_t): g_ig_j belongs to E(G) and h_sh_t belongs to E(H)}. We prove that the direct product M_m(G) X M_n(H) of the generalized Mycielskians of G and H is a cover graph if and only if G or H is bipartite.
Open AccessWhen is the Direct Product of Generalized Mycielskians a Cover Graph?
A graph is said to be a cover graph if it is the underlying graph of the Hasse diagram of a finite partially ordered set. The direct product G X H of graphs G and H is the graph having vertex set V(G) X V(H) and edge set E(G X H) = {(g_i,h_s)(g_j,h_t): g_ig_j belongs to E(G) and h_sh_t belongs to E(H)}. We prove that the direct product M_m(G) X M_n(H) of the generalized Mycielskians of G and H is a cover graph if and only if G or H is bipartite.
- 14 October 2010
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 23 (4) , 462-470
Hamiltonian numbers of Möbius double loop networks
- 14 October 2010
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 23 (4) , 462-470
Hamiltonian numbers of Möbius double loop networks
- 28 June 2009
- Published by Elsevier in Discrete Mathematics
- Vol. 309 (12) , 4205-4207
Geodetic sets and Steiner sets in graphs
- 28 June 2009
- Published by Elsevier in Discrete Mathematics
- Vol. 309 (12) , 4205-4207
Geodetic sets and Steiner sets in graphs
- 12 May 2009
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 157 (13) , 2969-2972
Full orientability of graphs with at most one dependent arc
- 12 May 2009
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 157 (13) , 2969-2972
Full orientability of graphs with at most one dependent arc