12 citations · 27 across the 10 of their papers we have counts for
10 papers
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…
Nordhaus-Gaddum-type theorem for total proper connection number of graphs
Wenjing Li, Xueliang Li, Jingshu Zhang
A graph is said to be \emph{total-colored} if all the edges and the vertices of the graph are colored. A path in a total-colored graph is called a \emph{total-proper path}…
3-Rainbow index and forbidden subgraphs
Wenjing Li, Xueliang Li, Jingshu Zhang
A tree in an edge-colored connected graph is called \emph{a rainbow tree} if no two edges of it are assigned the same color. For a vertex subset , a tree is ca…
The -proper index of complete bipartite and complete multipartite graphs
Wenjing Li, Xueliang Li, Jingshu Zhang
Let be a nontrivial connected graph of order with an edge-coloring ,, where adjacent edges may be colored with the same co…
Rainbow vertex-connection and forbidden subgraphs
Wenjing Li, Xueliang Li, Jingshu Zhang
A path in a vertex-colored graph is called \emph{vertex-rainbow} if its internal vertices have pairwise distinct colors. A graph is \emph{rainbow vertex-connected} if for any t…
Hardness result for the total rainbow -connection of graphs
Wenjing Li, Xueliang Li, Di Wu
A path in a total-colored graph is called \emph{total rainbow} if its edges and internal vertices have distinct colors. For an -connected graph and an integer with $1…
Second cohomology for finite groups of Lie type
Brian D. Boe, Brian Bonsignore, Theresa Brons +13
Let be a simple, simply-connected algebraic group defined over . Given a power of , let be the subgroup of …
First cohomology for finite groups of Lie type: simple modules with small dominant weights
Brian D. Boe, Adrian M. Brunyate, Jon F. Carlson +12
Let be an algebraically closed field of characteristic , and let be a simple, simply connected algebraic group defined over . Given , set $q=…
Cohomology of quantum groups: An analog of Kostant's Theorem
University of Georgia VIGRE Algebra Group, Irfan Bagci, Brian D. Boe +8
We prove the analog of Kostant's Theorem on Lie algebra cohomology in the context of quantum groups. We prove that Kostant's cohomology formula holds for quantum groups at a generi…