According to our database
1,
Wai Chee Shiu
authored at least 89 papers
between 1996 and 2024.
Collaborative distances:
2024
On local antimagic chromatic number of cycle-related join graphs II.
Discret. Math. Algorithms Appl., April, 2024
Spectral bounds for the vulnerability parameters of graphs.
Comput. Appl. Math., March, 2024
2023
AKCE Int. J. Graphs Comb., May, 2023
Approaches that output infinitely many graphs with small local antimagic chromatic number.
Discret. Math. Algorithms Appl., February, 2023
2021
On SD-Prime Labelings of Some One Point Unions of Gears.
Symmetry, 2021
Graphs with Minimal Strength.
Symmetry, 2021
On local antimagic chromatic number of cycle-related join graphs.
Discuss. Math. Graph Theory, 2021
2020
Affirmative Solutions on Local Antimagic Chromatic Number.
Graphs Comb., 2020
Choosability with separation of planar graphs without prescribed cycles.
Appl. Math. Comput., 2020
2019
Orthogonal embeddings of graphs in Euclidean space.
Electron. J. Graph Theory Appl., 2019
On the anti-Kekulé problem of cubic graphs.
Art Discret. Appl. Math., 2019
2018
Planar graphs with maximum degree 4 are strongly 19-edge-colorable.
Discret. Math., 2018
The neighbor expanded sum distinguishing index of Halin graphs.
Ars Comb., 2018
Bounding the sum of powers of normalized Laplacian eigenvalues of a graph.
Appl. Math. Comput., 2018
The integer-magic spectra and null sets of the Cartesian product of trees.
Australas. J Comb., 2018
2017
Coefficients of the Characteristic Polynomial of the (Signless, Normalized) Laplacian of a Graph.
Graphs Comb., 2017
L(j, k)-labeling numbers of square of paths.
AKCE Int. J. Graphs Comb., 2017
2016
L(j, k)-labeling number of Cartesian product of path and cycle.
J. Comb. Optim., 2016
The irregularity of two types of trees.
Discret. Math. Theor. Comput. Sci., 2016
Plane graphs with maximum degree 9 are entirely 11-choosable.
Discret. Math., 2016
Further results on super graceful labeling of graphs.
AKCE Int. J. Graphs Comb., 2016
2015
General Randić matrix and general Randić incidence matrix.
Discret. Appl. Math., 2015
Matching preclusion for cube-connected cycles.
Discret. Appl. Math., 2015
(2, 1)-total labeling of trees with large maximum degree.
Discret. Appl. Math., 2015
2014
Notes on L(1, 1) and L(2, 1) labelings for n-cube.
J. Comb. Optim., 2014
Circular L(j, k)-labeling number of direct product of path and cycle.
J. Comb. Optim., 2014
An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications.
Discret. Appl. Math., 2014
Characterization of 3-Regular Halin Graphs with Edge-face Total Chromatic Number Equal to Four.
Ars Comb., 2014
2013
The strong game colouring number of directed graphs.
Discret. Math., 2013
On the spectral radius of unicyclic graphs with fixed girth.
Ars Comb., 2013
Group-magic labelings and null sets of complete n-partite graphs with a deleted edge.
Australas. J Comb., 2013
2012
On the total restrained domination number of direct products of graphs.
Discuss. Math. Graph Theory, 2012
On the vertex-arboricity of planar graphs without 7-cycles.
Discret. Math., 2012
Some results on graphs with exactly two main eigenvalues.
Appl. Math. Lett., 2012
Some results on incidence coloring, star arboricity and domination number.
Australas. J Comb., 2012
Full friendly index sets of cylinder graphs.
Australas. J Comb., 2012
2011
A New Upper Bound on the Global Defensive Alliance Number in Trees.
Electron. J. Comb., 2011
2010
Triangle-free graphs with large independent domination number.
Discret. Optim., 2010
Forcing matching numbers of fullerene graphs.
Discret. Appl. Math., 2010
The smallest values of algebraic connectivity for unicyclic graphs.
Discret. Appl. Math., 2010
The Orderings of Bicyclic Graphs and Connected Graphs by Algebraic Connectivity.
Electron. J. Comb., 2010
Uniformly pair-bonded trees.
Ars Comb., 2010
A note on weakly connected domination number in graphs.
Ars Comb., 2010
The number of spanning trees of a graph.
Appl. Math. Lett., 2010
On the spectra of the fullerenes that contain a nontrivial cyclic-5-cutset.
Australas. J Comb., 2010
2009
Edge-Face Total Chromatic Number of Halin Graphs.
SIAM J. Discret. Math., 2009
The maximum Randic index of chemical trees with k pendants.
Discret. Math., 2009
Collapsible graphs and reductions of line graphs.
Discret. Math., 2009
A note on the domination dot-critical graphs.
Discret. Appl. Math., 2009
The strong chromatic index of complete cubic Halin graphs.
Appl. Math. Lett., 2009
ℤ<sub>k</sub>-magic labellings of fans and wheels with magic value zero.
Australas. J Comb., 2009
An algebraic approach for finding balance index sets.
Australas. J Comb., 2009
2008
A New Approach to the L(2, 1) -Labeling of Some Products of Graphs.
IEEE Trans. Circuits Syst. II Express Briefs, 2008
Improved Bounds on the L(2, 1)-Number of Direct and Strong Products of Graphs.
IEEE Trans. Circuits Syst. II Express Briefs, 2008
Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems.
SIAM J. Discret. Math., 2008
Trees with equal total and total restrained domination numbers.
Discuss. Math. Graph Theory, 2008
Invalid proofs on incidence coloring.
Discret. Math., 2008
Full friendly index sets of P<sub>2</sub>×P<sub>n</sub>.
Discret. Math., 2008
Extremal Hosoya index and Merrifield-Simmons index of hexagonal spiders.
Discret. Appl. Math., 2008
Cyclic bandwidth with an edge added.
Discret. Appl. Math., 2008
The L(2, 1)-labeling of K<sub>1, n</sub>-free graphs and its applications.
Appl. Math. Lett., 2008
Upper bounds on the paired-domination number.
Appl. Math. Lett., 2008
Ring-magic labelings of graphs.
Australas. J Comb., 2008
2007
Integer-magic spectra of sun graphs.
J. Comb. Optim., 2007
An <i>s</i> -Hamiltonian Line Graph Problem.
Graphs Comb., 2007
On the kth Eigenvalues of Trees with Perfect Matchings.
Discret. Math. Theor. Comput. Sci., 2007
2005
The 3-choosability of plane graphs of girth 4.
Discret. Math., 2005
2004
Invariant factors of graphs associated with hyperplane arrangements.
Discret. Math., 2004
2003
On Some Three-Color Ramsey Numbers.
Graphs Comb., 2003
Finite transition matrices for permutations avoiding pairs of length four patterns.
Discret. Math., 2003
Cell rotation graphs of strongly connected orientations of plane graphs with an application.
Discret. Appl. Math., 2003
2002
Edge-magic Indices of (n, n - 1)-graphs.
Electron. Notes Discret. Math., 2002
On generalized Ramsey numbers.
Discret. Math., 2002
On incidence coloring for some cubic graphs.
Discret. Math., 2002
Edge-gracefulness of the composition of paths with null graphs.
Discret. Math., 2002
Characterization of graphs with equal bandwidth and cyclic bandwidth.
Discret. Math., 2002
On Wiener numbers of polygonal nets.
Discret. Appl. Math., 2002
2001
On Structure of Some Plane Graphs with Application to Choosability.
J. Comb. Theory, Ser. B, 2001
On the equitable chromatic number of complete n-partite graphs.
Discret. Appl. Math., 2001
Linear Vertex Arboricity, Independence Number and Clique Cover Number.
Ars Comb., 2001
2000
Orthogonal (g, f)-factorizations in networks.
Networks, 2000
1999
On independent domination number of regular graphs.
Discret. Math., 1999
1997
On the bandwidth of convex triangulation meshes.
Discret. Math., 1997
Wiener Number of Hexagonal Jagged-rectangles.
Discret. Appl. Math., 1997
The Wiener Number of the Hexagonal Net.
Discret. Appl. Math., 1997
Existence of Ideal matrices.
Ars Comb., 1997
Decoding DeBruijn Arrays Constructed by the FMSS Method.
Ars Comb., 1997
On Bandwidth and Cyclic Bandwidth of Graphs.
Ars Comb., 1997
1996
Difference sets in groups containing subgroups of index 2.
Ars Comb., 1996
