Name
Affiliation
Papers
PING ZHANG
Department of Mathematics and Statistics, Western Michigan University, Kalamazoo, MI 49008
47
Collaborators
Citations 
PageRank 
44
292
47.70
Referers 
Referees 
References 
390
75
59
Search Limit
100390
Title
Citations
PageRank
Year
Vertex Identification in Grids and Prisms00.342022
Distance Vertex Identification In Graphs00.342021
Uniformly Connected Graphs - A Survey.00.342020
Another view of bipartite Ramsey numbers.00.342018
On the connectedness of 3-line graphs.00.342018
On k-Ramsey Numbers of Unicyclic-Star Graphs.00.342018
Rainbow disconnection in graphs.10.392018
On Eulerian irregularity in graphs.00.342014
On closed modular colorings of trees.00.342013
The Rainbow Connectivities of Small Cubic Graphs.20.452012
Nowhere-zero modular edge-graceful graphs.20.432012
The γ-Spectrum of a Graph.00.342011
On multiset colorings of graphs.20.552010
Rainbow trees in graphs and generalized connectivity373.312010
The Sigma Chromatic Number of a Graph20.782009
The Sigma Chromatic Number of a Graph20.782009
The rainbow connectivity of a graph335.592009
Recognizable colorings of graphs.51.052008
Distance defined by spanning trees in graphs.10.372007
Uniformly cordial graphs40.712006
On γ-labelings of trees.10.432005
On hamiltonian colorings of graphs20.562005
Resolving Edge Colorings In Graphs41.312005
Resolving Acyclic Partitions Of Graphs10.522004
On The Detour Number And Geodetic Number Of A Graph30.822004
Conditional resolvability in graphs: a survey211.952004
Radio k-colorings of paths.111.552004
Detour Domination In Graphs00.342004
Nonplanar Sequences Of Iterated R-Jump Graphs00.342003
Stratification and domination in graphs60.782003
Greedy F-colorings of graphs10.422003
On k-dimensional graphs and their bases.232.282003
Connected Resolving Sets In Graphs20.552003
On the geodetic number of a graph404.462002
Radio Labelings Of Cycles161.352002
The Steiner number of a graph141.552002
Convexity in oriented graphs70.962002
The Upper Forcing Geodetic Number Of A Graph40.622002
Connected partition dimensions of graphs.20.592002
On graphs with a unique minimum hull set.20.442001
On the planarity of iterated jump graphs00.342001
Orientation distance graphs10.632001
Full domination in graphs.00.342001
Geodetic sets in graphs.70.902000
The geodetic number of an oriented graph162.672000
On The Hull Number Of A Graph30.662000
The forcing geodetic number of a graph.142.891999