10 citations · 45 across the 28 of their papers we have counts for
10 papers · 1 filter
Conflict-free vertex-connections of graphs
Xueliang Li, Yingying Zhang, Xiaoyu Zhu +2
A path in a vertex-colored graph is called \emph{conflict free} if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be \emph{conflict-free ve…
Total proper connection and graph operations
Yingying Zhang, Xiaoyu Zhu
A graph is said to be {\it total-colored} if all the edges and vertices of the graph are colored. A path in a total-colored graph is a {\it total proper path} if any two adja…
Proper vertex connection and graph operations
Yingying Zhang, Xiaoyu Zhu
A path in a vertex-colored graph is a {\it vertex-proper path} if any two internal adjacent vertices differ in color. A vertex-colored graph is {\it proper vertex -connected} if…
Erdős-Gallai-type results for total monochromatic connection of graphs
Hui Jiang, Xueliang Li, Yingying Zhang
A graph is said to be {\it total-colored} if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a {\it total monochromatically-connecting color…
More on total monochromatic connection of graphs
Hui Jiang, Xueliang Li, Yingying Zhang
A graph is said to be {\it total-colored} if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a {\it total monochromatically-connecting color…
Total monochromatic connection of graphs
Hui Jiang, Xueliang Li, Yingying Zhang
A graph is said to be {\it total-colored} if all the edges and the vertices of the graph are colored. A path in a total-colored graph is a {\it total monochromatic path} if all the…
Total proper connection of graphs
Hui Jiang, Xueliang Li, Yingying Zhang
A graph is said to be {\it total-colored} if all the edges and the vertices of the graph is colored. A path in a total-colored graph is a {\it total proper path} if any two a…
On (strong) proper vertex-connection of graphs
Hui Jiang, Xueliang Li, Yingying Zhang +1
A path in a vertex-colored graph is a {\it vertex-proper path} if any two internal adjacent vertices differ in color. A vertex-colored graph is {\it proper vertex -connected} if…
Good upper bounds for the total rainbow connection of graphs
Hui Jiang, Xueliang Li, Yingying Zhang
A total-colored graph is a graph such that both all edges and all vertices of are colored. A path in a total-colored graph is a total rainbow path if its edges and inte…
-Regular mixed graphs with optimum Hermitian energy
Xiaolin Chen, Xueliang Li, Yingying Zhang
Let be a simple undirected graph, and be a mixed graph of with the generalized orientation and Hermitian-adjacency matrix . Then is called the underly…