Zehui Shao

Orcid: 0000-0003-0764-4135

Affiliations:
  • School of Information Science and Engineering, Chengdu University, China
  • Research Institute of Intelligence Software, Guangzhou University, China


According to our database1, Zehui Shao authored at least 98 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On maximal Roman domination in graphs: complexity and algorithms.
RAIRO Oper. Res., 2024

A Faster Algorithm for the 4-Coloring Problem.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023
Certain Notions of Regularity in Vague Graphs with Novel Application.
J. Multiple Valued Log. Soft Comput., 2023

New Kind of Vague Graphs with Novel Application.
J. Multiple Valued Log. Soft Comput., 2023

Fuzzy Decision Making in Medical Diagnosis Using Vague Sets.
J. Multiple Valued Log. Soft Comput., 2023

Some Types of Domination in Vague Graphs with Application in Medicine.
J. Multiple Valued Log. Soft Comput., 2023

2022
Quasi-total Roman bondage number in graphs.
AKCE Int. J. Graphs Comb., September, 2022

Independent Roman Domination: The Complexity and Linear-Time Algorithm for Trees.
Symmetry, 2022

Strong equality of Roman and perfect Roman Domination in trees.
RAIRO Oper. Res., 2022

A proof of a conjecture on the paired-domination subdivision number.
Graphs Comb., 2022

Double Roman Domination in Graphs with Minimum Degree at Least Two and No C<sub>5</sub>-cycle.
Graphs Comb., 2022

Cubic graphs have paired-domination number at most four-seventh of their orders.
Discret. Math., 2022

Exact algorithms for counting 3-colorings of graphs.
Discret. Appl. Math., 2022

New results on radio k-labelings of distance graphs.
Discret. Appl. Math., 2022

Matrix Multiplication with Less Arithmetic Complexity and IO Complexity.
CoRR, 2022

2021
Optimizing distance constraints frequency assignment with relaxation.
RAIRO Oper. Res., 2021

New Concepts of Intuitionistic Fuzzy Trees with Applications.
Int. J. Comput. Intell. Syst., 2021

On the star chromatic index of generalized Petersen graphs.
Discuss. Math. Graph Theory, 2021

On a conjecture concerning total domination subdivision number in graphs.
AKCE Int. J. Graphs Comb., 2021

2020
Total Roman {3}-domination in Graphs.
Symmetry, 2020

A Study on Domination in Vague Incidence Graph and Its Application in Medical Sciences.
Symmetry, 2020

Vague Graph Structure with Application in Medical Diagnosis.
Symmetry, 2020

Modeling and simulation of novel dynamic control strategy for PV-wind hybrid power system using FGS-PID and RBFNSM methods.
Soft Comput., 2020

On the Roman domination subdivision number of a graph.
J. Comb. Optim., 2020

Bounds on the signed total Roman 2-domination in graphs.
Discret. Math. Algorithms Appl., 2020

Total k-rainbow domination subdivision number in graphs.
Comput. Sci. J. Moldova, 2020

Outer-Convex Dominating Set in the Corona of Graphs as Encryption Key Generator.
Complex., 2020

Bond Incident Degree Indices of Catacondensed Pentagonal Systems.
Complex., 2020

Interval edge-coloring: A model of curriculum scheduling.
AKCE Int. J. Graphs Comb., 2020

2019
On Metric Dimension in Some Hex Derived Networks.
Sensors, 2019

Bounds for signed double Roman <i>k</i>-domination in trees.
RAIRO Oper. Res., 2019

Trees with equal Roman {2}-domination number and independent Roman {2}-domination number.
RAIRO Oper. Res., 2019

A Non-linear and Noise-Tolerant ZNN Model and Its Application to Static and Time-Varying Matrix Square Root Finding.
Neural Process. Lett., 2019

Multi-factor combination authentication using fuzzy graph domination model.
J. Intell. Fuzzy Syst., 2019

2-Rainbow domination stability of graphs.
J. Comb. Optim., 2019

On the 2-rainbow domination stable graphs.
J. Comb. Optim., 2019

Construction of acyclically 4-colourable planar triangulations with minimum degree 4.
Int. J. Comput. Math., 2019

On the co-Roman domination in graphs.
Discuss. Math. Graph Theory, 2019

On graphs with the maximum edge metric dimension.
Discret. Appl. Math., 2019

On 2-rainbow domination of generalized Petersen graphs.
Discret. Appl. Math., 2019

Changing and Unchanging 2-Rainbow Independent Domination.
IEEE Access, 2019

On the Total Double Roman Domination.
IEEE Access, 2019

Outer-Independent Italian Domination in Graphs.
IEEE Access, 2019

2018
Computing Zagreb Indices and Zagreb Polynomials for Symmetrical Nanotubes.
Symmetry, 2018

<i>L</i>(2, 1)-labeling of the Cartesian and strong product of two directed cycles.
Math. Found. Comput., 2018

Weak {2}-domination number of Cartesian products of cycles.
J. Comb. Optim., 2018

Extremal problems on weak Roman domination number.
Inf. Process. Lett., 2018

Double Roman domination in trees.
Inf. Process. Lett., 2018

NP-completeness of local colorings of graphs.
Inf. Process. Lett., 2018

<i>L</i>(<i>d</i>, 1)-labellings of generalised Petersen graphs.
Int. J. Auton. Adapt. Commun. Syst., 2018

The Domination Complexity and Related Extremal Values of Large 3D Torus.
Complex., 2018

On acyclically 4-colorable maximal planar graphs.
Appl. Math. Comput., 2018

Signed double Roman k-domination in graphs.
Australas. J Comb., 2018

Independent Roman Domination Stable and Vertex-Critical Graphs.
IEEE Access, 2018

On the Maximum ABC Index of Graphs With Prescribed Size and Without Pendent Vertices.
IEEE Access, 2018

Discharging Approach for Double Roman Domination in Graphs.
IEEE Access, 2018

Computational Complexity of Outer-Independent Total and Total Roman Domination Numbers in Trees.
IEEE Access, 2018

Metric Dimension and Robot Navigation in Specific Sensor Networks.
Proceedings of the International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 2018

The Rainbow Restrained Domination in Torus Network.
Proceedings of the International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 2018

2017
基于局部比值法的强弦图带权控制集问题的线性时间算法 (Linear-time Algorithm for Weighted Domination Problem of Strongly Chordal Graph Based on Local Ratio Method).
计算机科学, 2017

On the L(2, 1)-labeling conjecture for brick product graphs.
J. Comb. Optim., 2017

A note on uniquely 3-colourable planar graphs.
Int. J. Comput. Math., 2017

New optimal modular Sidon sets.
Int. J. Auton. Adapt. Commun. Syst., 2017

Semitotal Domination in Claw-Free Cubic Graphs.
Graphs Comb., 2017

On the signed Roman k-domination: Complexity and thin torus graphs.
Discret. Appl. Math., 2017

Frequency assignment problem in networks with limited spectrum.
Central Eur. J. Oper. Res., 2017

On the maximum ABC index of graphs without pendent vertices.
Appl. Math. Comput., 2017

2016
Mobile Crowd Sensing for Traffic Prediction in Internet of Vehicles.
Sensors, 2016

Acyclic 3-coloring of generalized Petersen graphs.
J. Comb. Optim., 2016

L(2, 1)-labeling for brick product graphs.
J. Comb. Optim., 2016

Acyclically 4-colorable triangulations.
Inf. Process. Lett., 2016

Size of edge-critical uniquely 3-colorable planar graphs.
Discret. Math., 2016

On dominating sets of maximal outerplanar and planar graphs.
Discret. Appl. Math., 2016

Star coloring of Cartesian product of paths and cycles.
Ars Comb., 2016

On Adjacent Vertex-Distinguishing Total Chromatic Number of Generalized Petersen Graphs.
Proceedings of the IEEE First International Conference on Data Science in Cyberspace, 2016

2015
Tree-core and tree-coritivity of graphs.
Inf. Process. Lett., 2015

A note on local coloring of graphs.
Inf. Process. Lett., 2015

Local colourings of Cartesian product graphs.
Int. J. Comput. Math., 2015

\(L(3, 2, 1)\) -labeling of triangular and toroidal grids.
Central Eur. J. Oper. Res., 2015

Bounds on the domination number of Kneser graphs.
Ars Math. Contemp., 2015

2014
On rainbow domination numbers of graphs.
Inf. Sci., 2014

On the circular-l(2, 1)-labelling for strong products of paths and cycles.
IET Commun., 2014

2013
On the Domination Number of Cartesian Product of Two Directed Cycles.
J. Appl. Math., 2013

Integer linear programming model and satisfiability test reduction for distance constrained labellings of graphs: the case of L(3, 2, 1)labelling for products of paths and cycles.
IET Commun., 2013

A note on the chromatic number of the square of the Cartesian product of two cycles.
Discret. Math., 2013

Upper bounds for the vertex Folkman number F<sub>v</sub>(3, 3, 3;4) and F<sub>v</sub>(3, 3, 3;5).
Ars Comb., 2013

An Efficient Local Search for the Feedback Vertex Set Problem.
Algorithms, 2013

2012
Upper bounds on the connection probability for 2-D meshes and tori.
J. Parallel Distributed Comput., 2012

On sets without k-term arithmetic progression.
J. Comput. Syst. Sci., 2012

Some new optimal generalized Sidon sequences.
Ars Comb., 2012

2011
More Constructive Lower Bounds on Classical Ramsey Numbers.
SIAM J. Discret. Math., 2011

2010
Upper and lower bounds for <i>F<sub>v</sub></i>(4,4;5).
Electron. J. Comb., 2010

Lower Bounds on Ramsey Numbers R(6, 8), R(7, 9) and R(8, 17).
Ars Comb., 2010

On the Ramsey Numbers R(C<sub>m</sub>, B<sub>n</sub>).
Ars Comb., 2010

2009
Set-coloring of Edges and Multigraph Ramsey Numbers.
Graphs Comb., 2009

Some three-color Ramsey numbers, R(P<sub>4</sub>, P<sub>5</sub>, C<sub>k</sub>) and R(P<sub>4</sub>, P<sub>6</sub>, C<sub>k</sub>).
Eur. J. Comb., 2009

Bounds on Some Ramsey Numbers Involving Quadrilateral.
Ars Comb., 2009

2007
A genetic algorithm for solving multi-constrained function optimization problems based on KS function.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007


  Loading...