198 citations
- Lanzhou UniversityCN37 papers
- Institute of Theoretical PhysicsCN14 papers
- Nankai UniversityCN13 papers
- Institute of Modern PhysicsCN11 papers
- Ludong UniversityCN6 papers
- Oakland UniversityUS5 papers
- Beijing Normal UniversityCN4 papers
- China Jiliang UniversityCN4 papers
- Qinghai UniversityCN4 papers
- Georgia Southern UniversityUS3 papers
- Northwest Normal UniversityCN3 papers
- Chinese Academy of SciencesCN2 papers
4 papers · 2 filters
Conflict-free connection numbers of line graphs
Bo Deng, Wenjing Li, Xueliang Li +2
A path in an edge-colored graph is called \emph{conflict-free} if it contains at least one color used on exactly one of its edges. An edge-colored graph is \emph{conflict-free…
Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
Wenjing Li, Xueliang Li, Colton Magnant +1
A graph is said to be \emph{total-colored} if all the edges and the vertices of the graph are colored. A total-colored graph is \emph{total-rainbow connected} if any two vertices o…
Steiner 3-diameter, maximum degree and size of a graph
Yaping Mao
The Steiner -diameter of a graph , introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical diameter. W…
Steiner Distance in Product Networks
Yaping Mao, Eddie Cheng, Zhao Wang
For a connected graph of order at least and , the \emph{Steiner distance} among the vertices of is the minimum size among all connected subgra…