Skip to main navigation
Skip to search
Skip to main content
Hong Kong Baptist University Home
Help & FAQ
Home
Scholars
Departments / Units
Research Output
Projects / Grants
Prizes / Awards
Activities
Press/Media
Student theses
Datasets
Search by expertise, name or affiliation
View Scopus Profile
Pak Kiu SUN, Dr
Lecturer I
,
Department of Mathematics
https://orcid.org/0000-0003-3184-8680
Email
lionel
hkbu.edu
hk
2008
2019
Research activity per year
Overview
Fingerprint
Network
Research Output
(13)
Similar Scholars
(6)
Fingerprint
Dive into the research topics where Pak Kiu SUN is active. Topic labels come from the works of this scholar. Together they form a unique fingerprint.
Sort by:
Weight
Alphabetically
Keyphrases
Incidence Coloring
100%
Incidence Chromatic number
100%
K-connected
66%
L(j,k)-labeling
66%
Connected Graph
55%
Domination number
50%
Maximum Degree
44%
Cubic Graph
44%
Strong Games
33%
Total Restrained Domination number
33%
Game Coloring number
33%
Complement Graph
33%
Clar Covering Polynomials
33%
Cartesian Product of Paths
33%
Cartesian Product of Cycles
33%
Cube Polynomials
33%
Outerplanar Graph
33%
Star Arboricity
33%
Spectral Radius
33%
Signless Laplacian Spectral Radius
33%
Invalid
33%
Regular Graph
33%
Directed Graph
33%
Direct Product of Graphs
33%
L(2,1)-labeling
33%
Irregular Graph
33%
Total Restrained Dominating Set
22%
Hexagonal System
22%
Clar Cover
22%
Graph Coloring
22%
Discrete Mathematics
22%
Cardinality
22%
Planar Graph
19%
Nordhaus-Gaddum Inequalities
16%
Infinite Family
11%
Join of Graphs
11%
Color Set
11%
2-connected
11%
Cubic Bipartite Graphs
11%
Resonance Graph
11%
Clar number
11%
Counting Polynomial
11%
Spanning Subgraph
11%
Incidence Coloring number
11%
Spectral Radius of a Graph
11%
Hypercube
11%
Resonant Structure
11%
Chromatic number of a Graph
11%
Sharp Upper Bounds
11%
Largest Eigenvalue
11%
Mathematics
Chromatic Number
100%
domination number γ
83%
Direct Product
66%
Spectral Radius
66%
Connected Graph
61%
Edge
55%
positive number δ
50%
Cartesian Product
44%
Laplace Operator
33%
Regular Graph
33%
Cube
33%
Polynomial
33%
Arboricity
33%
Bipartite Graph
27%
Cardinality
27%
Dominating Set
22%
Upper Bound
22%
Lower and upper bounds
22%
Polynomial Time
16%
Perfect Matching
16%
Necessary and Sufficient Condition
16%
Graph Invariants
11%
Standard Deviation
11%
Planar Graph
11%
Adjacency Matrix
11%
Maximum Degree
11%
Eigenvalue
11%
Sufficient Condition
11%
Maximum Spectral Radius
11%
