38 citations · 77 across the 17 of their papers we have counts for
17 papers
Epidemic Source Detection in Contact Tracing Networks: Epidemic Centrality in Graphs and Message-Passing Algorithms
Pei-Duo Yu, Chee Wei Tan, Hung-Lin Fu
We study the epidemic source detection problem in contact tracing networks modeled as a graph-constrained maximum likelihood estimation problem using the susceptible-infected model…
Total Colorings of Some Classes of FourRegular Circulant Graphs
R. Navaneeth, J. Geetha, K. Somasundaram +1
The total chromatic number, is the minimum number of colors which need to be assigned to obtain a total coloring of the graph . The Total Coloring Conjecture (TCC) made…
Strongly separable matrices for nonadaptive combinatorial group testing
Jinping Fan, Hung-Lin Fu, Yujie Gu +2
In nonadaptive combinatorial group testing (CGT), it is desirable to identify a small set of up to defectives from a large population of items with as few tests (i.e. large…
Beyond Hamiltonicity of Prime Difference Graphs
Hong-Bin Chen, Hung-Lin Fu, Jun-Yi Guo
A graph is Hamiltonian if it contains a cycle which visits every vertex of the graph exactly once. In this paper, we consider the problem of Hamiltonicity of a graph , which w…
Total Coloring of some classes of Powers of Cycles
Prajnanaswaroopa S, J Geetha, K Somasundaram +2
In this paper, we have obtained the total chromatic number of some classes of Cayley graphs, odd graphs and mock threshold graphs.
On the integer {k}-domination number of circulant graphs
Yen-Jen Cheng, Hung-Lin Fu, Chia-an Liu
Let be a simple undirected graph. is a circulant graph defined on with difference set provided…
The Undirected Optical Indices of Trees
Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang +1
For a connected graph , an instance is a set of pairs of vertices and a corresponding routing is a set of paths specified for all vertex-pairs in . Let $\mathfrak{R}_…
From a Consequence of Bertrand's Postulate to Hamilton Cycles
Hong-Bin Chen, Hung-Lin Fu, Jun-Yi Guo
A consequence of Bertrand's postulate, proved by L. Greenfield and S. Greenfield in 1998, assures that the set of integers can be partitioned into pairs so tha…
The Undirected Optical Indices of Complete -ary Trees
Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang +1
The routing and wavelength assignment problem arises from the investigation of optimal wavelength allocation in an optical network that employs Wavelength Division Multiplexing (WD…
On the Number of Rainbow Spanning Trees in Edge-Colored Complete Graphs
Hung-Lin Fu, Yuan-Hsun Lo, K. E. Perry +1
A spanning tree of a properly edge-colored complete graph, , is rainbow provided that each of its edges receives a distinct color. In 1996, Brualdi and Hollingsworth conjectur…
The Global Packing Number for an Optical Network
Yuan-Hsun Lo, Yijin Zhang, Wing Shing Wong +1
The global packing number problem arises from the investigation of optimal wavelength allocation in an optical network that employs Wavelength Division Multiplexing (WDM). Consider…
The Hamilton-Waterloo Problem for Triangle-Factors and Heptagon-Factors
Hongchuan Lei, Hung-Lin Fu
Given 2-factors and of order , let and be nonnegative integers with , the Hamilton-Waterloo problem asks for a 2-factorization…
Partially user-irrepressible sequence sets and conflict-avoiding codes
Yuan-Hsun Lo, Wing Shing Wong, Hung-Lin Fu
In this paper we give a partial shift version of user-irrepressible sequence sets and conflict-avoiding codes. By means of disjoint difference sets, we obtain an infinite number of…
Codes with the Identifiable Parent Property for Multimedia Fingerprinting
Minquan Cheng, Hung-Lin Fu, Jing Jiang +2
Let be a -ary code of length and size , and be the s…
Multicolored Isomorphic Spanning Trees in Complete Graphs
Hung-Lin Fu, Yuan-Hsun Lo
In this paper, we first prove that if the edges of are properly colored by colors in such a way that any two colors induce a 2-factor of which each component is a 4…
Edge-colorings of which Forbid Multicolored Cycles
Hung-Lin Fu, Yuan-Hsun Lo, Ryo-Yu Pei
A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, we study the proper edge-colorings of the complete bipartite graph $K_{…
Sparseness of 4-cycle systems
Yuichiro Fujiwara, Shung-Liang Wu, Hung-Lin Fu
An avoidance problem of configurations in 4-cycle systems is investigated by generalizing the notion of sparseness, which is originally from Erdős' r-sparse conjecture on Steiner t…