Author Info
Name
Affiliation
Papers
ZEHUI SHAO
University Key Laboratory of Pattern Recognition and Intelligent Information Processing Sichuan Province, School of Information Science and Technology, Chengdu University, Chengdu 610106, China
78
Collaborators
Citations 
PageRank 
111
119
30.98
Referers 
Referees 
References 
356
648
324
Search Limit
100648
Title
Citations
PageRank
Year
Independent Roman Domination: The Complexity and Linear-Time Algorithm for Trees00.342022
STRONG EQUALITY OF ROMAN AND PERFECT ROMAN DOMINATION IN TREES00.342022
A proof of a conjecture on the paired-domination subdivision number00.342022
Optimizing Distance Constraints Frequency Assignment With Relaxation00.342021
On The Star Chromatic Index Of Generalized Petersen Graphs00.342021
Vague Graph Structure with Application in Medical Diagnosis.00.342020
A Study on Domination in Vague Incidence Graph and Its Application in Medical Sciences.00.342020
Modeling and simulation of novel dynamic control strategy for PV–wind hybrid power system using FGS−PID and RBFNSM methods00.342020
Interval Edge-Coloring: A Model Of Curriculum Scheduling10.372020
Total K-Rainbow Domination Subdivision Number In Graphs00.342020
Total Roman {3}-domination in Graphs00.342020
Bounds On The Signed Total Roman 2-Domination In Graphs00.342020
On Metric Dimension in Some Hex Derived Networks.00.342019
On the 2-rainbow domination stable graphs00.342019
On the co-Roman domination in graphs.10.402019
Bounds for signed double Roman -domination in trees.00.342019
On 2-rainbow domination of generalized Petersen graphs00.342019
Signed double Roman $k$-domination in graphs.00.342019
Multi-factor combination authentication using fuzzy graph domination model00.342019
On the Total Double Roman Domination00.342019
2-Rainbow domination stability of graphs00.342019
Outer-Independent Italian Domination in Graphs.00.342019
Trees with equal Roman {2}-domination number and independent Roman {2}-domination number00.342019
On graphs with the maximum edge metric dimension10.402019
Construction Of Acyclically 4-Colourable Planar Triangulations With Minimum Degree 400.342019
Computational Complexity of Outer-Independent Total and Total Roman Domination Numbers in Trees00.342018
Metric Dimension and Robot Navigation in Specific Sensor Networks00.342018
Extremal problems on weak Roman domination number.00.342018
L(d, 1)-labellings of generalised Petersen graphs.00.342018
Double Roman domination in trees.30.452018
The Domination Complexity and Related Extremal Values of Large 3D Torus.00.342018
L(2, 1)-Labeling Of The Cartesian And Strong Product Of Two Directed Cycles00.342018
Discharging Approach for Double Roman Domination in Graphs.00.342018
The Rainbow Restrained Domination in Torus Network00.342018
NP-completeness of local colorings of graphs.10.412018
Independent Roman Domination Stable And Vertex-Critical Graphs00.342018
On the Maximum ABC Index of Graphs With Prescribed Size and Without Pendent Vertices.20.432018
On acyclically 4-colorable maximal planar graphs.10.352018
Weak {2}-domination number of Cartesian products of cycles.00.342018
Computing Zagreb Indices and Zagreb Polynomials for Symmetrical Nanotubes.40.512018
On the maximum ABC index of graphs without pendent vertices.60.682017
A note on uniquely 3-colourable planar graphs.10.372017
基于局部比值法的强弦图带权控制集问题的线性时间算法 (Linear-time Algorithm for Weighted Domination Problem of Strongly Chordal Graph Based on Local Ratio Method).00.342017
Semitotal Domination in Claw-Free Cubic Graphs.60.632017
New optimal modular Sidon sets.00.342017
Frequency assignment problem in networks with limited spectrum.00.342017
On the (2, 1)-labeling conjecture for brick product graphs00.342017
On the signed Roman k-domination: Complexity and thin torus graphs.20.522017
Acyclic 3-coloring of generalized Petersen graphs.10.362016
On Adjacent Vertex-Distinguishing Total Chromatic Number of Generalized Petersen Graphs00.342016
  • 1
  • 2
  • 50 / page