20 citations · 101 across the 20 of their papers we have counts for
4 papers · 1 filter
Probing Graph Proper Total Colorings With Additional Constrained Conditions
Bing Yao, Ming Yao, Xiang-en Chen
Graph colorings are becoming an increasingly useful family of mathematical models for a broad range of applications, such as time tabling and scheduling, frequency assignment, regi…
Improper Graceful and Odd-graceful Labellings of Graph Theory
Hongyu Wang, Jin Xu, Bing Yao
In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can ind…
The Join of Scale-free Network Models
Xiaomin Wang, Bing Yao, Jin Xu
We focus on constructing the domi-join model by doing the join operation based on two smallest dominating sets of two network models and analysis the properties of domi-join model,…
Growing Network Models Having Part Edges Removed/added Randomly
Bing Yao, Xiaomin Wang, Xia Liu +1
Since network motifs are an important property of networks and some networks have the behaviors of rewiring or reducing or adding edges between old vertices before new vertices ent…