Ping Zhang

Affiliations:
  • Western Michigan University, Kalamazoo, MI, USA


According to our database1, Ping Zhang authored at least 83 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On subset labelings of trees.
AKCE Int. J. Graphs Comb., 2024

2023
Ramsey Chains in Linear Forests.
Axioms, November, 2023

The Ascending Ramsey Index of a Graph.
Symmetry, February, 2023

2022
Vertex Identification in Grids and Prisms.
J. Interconnect. Networks, 2022

Irregular orbital domination in graphs.
Int. J. Comput. Math. Comput. Syst. Theory, 2022

2021
Distance Vertex Identification in Graphs.
J. Interconnect. Networks, 2021

2020
Uniformly Connected Graphs - A Survey.
Parallel Process. Lett., 2020

Dominating functions in graphs - regularity versus irregularity.
Int. J. Comput. Math. Comput. Syst. Theory, 2020

Regular dominating functions in regular graphs.
Bull. ICA, 2020

Rainbow mean colorings of bipartite graphs.
Bull. ICA, 2020

Ramsey sequences of graphs.
AKCE Int. J. Graphs Comb., 2020

2018
Rainbow disconnection in graphs.
Discuss. Math. Graph Theory, 2018

Another view of bipartite Ramsey numbers.
Discuss. Math. Graph Theory, 2018

Schwenk graphs of cages.
Bull. ICA, 2018

On k-Ramsey Numbers of Unicyclic-Star Graphs.
Ars Comb., 2018

On the connectedness of 3-line graphs.
Australas. J Comb., 2018

2017
Stars and Their k-Ramsey Numbers.
Graphs Comb., 2017

Kaleidoscopic colorings of graphs.
Discuss. Math. Graph Theory, 2017

Proper Hamiltonian-Connected Graphs.
Bull. ICA, 2017

2016
Characterizations of graphs having large proper connection numbers.
Discuss. Math. Graph Theory, 2016

2015
On <i>k</i>-path pancyclic graphs.
Discuss. Math. Graph Theory, 2015

2014
On Eulerian irregularity in graphs.
Discuss. Math. Graph Theory, 2014

On twin edge colorings of graphs.
Discuss. Math. Graph Theory, 2014

A cycle decomposition conjecture for Eulerian graphs.
Australas. J Comb., 2014

2013
On Modular Edge-Graceful Graphs.
Graphs Comb., 2013

On closed modular colorings of trees.
Discuss. Math. Graph Theory, 2013

2012
Nowhere-zero modular edge-graceful graphs.
Discuss. Math. Graph Theory, 2012

Hamiltonian-colored powers of strong digraphs.
Discuss. Math. Graph Theory, 2012

Vertex rainbow colorings of graphs.
Discuss. Math. Graph Theory, 2012

The Rainbow Connectivities of Small Cubic Graphs.
Ars Comb., 2012

2011
The γ-Spectrum of a Graph.
Ars Comb., 2011

2010
Rainbow trees in graphs and generalized connectivity.
Networks, 2010

The Sigma Chromatic Number of a Graph.
Graphs Comb., 2010

On multiset colorings of graphs.
Discuss. Math. Graph Theory, 2010

2009
The rainbow connectivity of a graph.
Networks, 2009

A sufficient condition for pancyclic graphs.
Inf. Process. Lett., 2009

The set chromatic number of a graph.
Discuss. Math. Graph Theory, 2009

A survey of stratified domination in graphs.
Discret. Math., 2009

A dedication to Professor Gary Chartrand.
Discret. Math., 2009

The metric chromatic number of a graph.
Australas. J Comb., 2009

2008
Recognizable colorings of graphs.
Discuss. Math. Graph Theory, 2008

Extremal problems on detectable colorings of trees.
Discret. Math., 2008

2007
Distance defined by spanning trees in graphs.
Discuss. Math. Graph Theory, 2007

2006
On stratification and domination in graphs.
Discuss. Math. Graph Theory, 2006

Uniformly cordial graphs.
Discret. Math., 2006

2005
On <i>γ</i>-labelings of trees.
Discuss. Math. Graph Theory, 2005

On the dimension of trees.
Discret. Math., 2005

Hamiltonian colorings of graphs.
Discret. Appl. Math., 2005

Resolving Edge Colorings in Graphs.
Ars Comb., 2005

2004
Conditional resolvability in graphs: a survey.
Int. J. Math. Math. Sci., 2004

Radio k-colorings of paths.
Discuss. Math. Graph Theory, 2004

On Resolving Acyclic Partitions of Graphs.
Ars Comb., 2004

On the Detour Number and Geodetic Number of a Graph.
Ars Comb., 2004

Detour Domination in Graphs.
Ars Comb., 2004

2003
On <i>k</i>-dimensional graphs and their bases.
Period. Math. Hung., 2003

Greedy <i>F</i>-colorings of graphs.
Discret. Math., 2003

Stratification and domination in graphs.
Discret. Math., 2003

Boundary vertices in graphs.
Discret. Math., 2003

Graphs of order <i>n</i> with locating-chromatic number <i>n</i>-1.
Discret. Math., 2003

Connected Resolving Sets in Graphs.
Ars Comb., 2003

Nonplanar Sequences of Iterated r-Jump Graphs.
Ars Comb., 2003

On connected resolvability of graphs.
Australas. J Comb., 2003

Graphical Measurement.
Proceedings of the Handbook of Graph Theory., 2003

2002
On the geodetic number of a graph.
Networks, 2002

The Convexity Number of a Graph.
Graphs Comb., 2002

Connected partition dimensions of graphs.
Discuss. Math. Graph Theory, 2002

The Steiner number of a graph.
Discret. Math., 2002

Convexity in oriented graphs.
Discret. Appl. Math., 2002

Radio Labelings of Cycles.
Ars Comb., 2002

k-Geodomination in graphs.
Ars Comb., 2002

2001
Orientation distance graphs.
J. Graph Theory, 2001

The Decomposition Dimension of Graphs.
Graphs Comb., 2001

On graphs with a unique minimum hull set.
Discuss. Math. Graph Theory, 2001

Full domination in graphs.
Discuss. Math. Graph Theory, 2001

On the planarity of iterated jump graphs.
Discret. Math., 2001

2000
The Geodetic Number of an Oriented Graph.
Eur. J. Comb., 2000

Geodetic sets in graphs.
Discuss. Math. Graph Theory, 2000

On the planarity of jump graphs.
Discret. Math., 2000

On the Hall Number of a Graph.
Ars Comb., 2000

How large can the domination numbers of a graph be?
Australas. J Comb., 2000

1999
The forcing geodetic number of a graph.
Discuss. Math. Graph Theory, 1999

The Steiner distance dimension of graphs.
Australas. J Comb., 1999

1997
The characteristic polynomials of subarrangements of Coxeter arrangements.
Discret. Math., 1997


  Loading...