1 citations · 1 across the 5 of their papers we have counts for
5 papers
A Conjecture on Zero-sum 3-magic Labeling of 5-regular Graphs
Guanghuang Dong, Ning Wang
In this paper, we obtained that every 5-regular graph admits a zero-sum 3-magic labeling, which give an affirmative answer to a conjecture proposed by Saieed Akbari, Farhad Rahmati…
The extremal genus embedding of graphs
Guanghua Dong, Han Ren, Ning Wang +1
Let Wn be a wheel graph with n spokes. How does the genus change if adding a degree-3 vertex v, which is not in V (Wn), to the graph Wn? In this paper, through the joint-tree model…
Lower bound on the number of the maximum genus embedding of
Guanghua Dong, Han Ren, Ning Wang +1
In this paper, we provide an method to obtain the lower bound on the number of the distinct maximum genus embedding of the complete bipartite graph Kn;n (n be an odd number), which…
Joint-tree model and the maximum genus of graphs
Guanghua Dong, Ning Wang, Yuanqiu Huang +1
The vertex v of a graph G is called a 1-critical-vertex for the maximum genus of the graph, or for simplicity called 1-critical-vertex, if G-v is a connected graph and °M(G - v) =…
Vertex Splitting and Upper Embeddable Graphs
Guanghua Dong, Ning Wang, Yuanqiu Huang +2
The weak minor G of a graph G is the graph obtained from G by a sequence of edge-contraction operations on G. A weak-minor-closed family of upper embeddable graphs is a set G of up…