Results 31 to 40 of about 28,564 (220)
Rainbow Vertex-Connection and Forbidden Subgraphs
Discussiones Mathematicae Graph Theory, 2018 A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them ...
Li Wenjing, Li Xueliang, Zhang Jingshu
doaj +1 more source
General Randic matrix and general Randi'c energy [PDF]
Transactions on Combinatorics, 2014 Let $G$ be a simple graph with vertex set $V(G) = {v_1, v_2,ldots , v_n}$ and $d_i$ the degree of its vertex $v_i$, $i = 1, 2, cdots, n$. Inspired by the Randi'c matrix and the general Randi'c index of a graph, we introduce the concept of general ...
Ran Gu;, Fei Huang, Xueliang Li
doaj
Erdős-Gallai-Type Results for Total Monochromatic Connection of Graphs
Discussiones Mathematicae Graph Theory, 2019 A graph is said to be total-colored if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a total monochromatically-connecting coloring (TMC-coloring, for short) if any two vertices of the graph are connected by a ...
Jiang Hui, Li Xueliang, Zhang Yingying
doaj +1 more source
Backbone colouring and algorithms for TDMA scheduling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 We investigate graph colouring models for the purpose of optimizing TDMA link scheduling in Wireless Networks. Inspired by the BPRN-colouring model recently introduced by Rocha and Sasaki, we introduce a new colouring model, namely the BMRN-colouring ...
Julien Bensmail +4 more
doaj +1 more source
On the Combinatorics of Gentle Algebras [PDF]
Canadian Journal of Mathematics - Journal Canadien de Mathematiques, 2017 For $A$ a gentle algebra, and $X$ and $Y$ string modules, we construct a combinatorial basis for $\operatorname{Hom}(X,\unicode[STIX]{x1D70F}Y)$. We use this to describe support $\unicode[STIX]{x1D70F}$-tilting modules for $A$.
T. Brüstle +4 more
semanticscholar +1 more source
The 3-Rainbow Index of a Graph
Discussiones Mathematicae Graph Theory, 2015 Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ ℕ, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color.
Chen Lily +3 more
doaj +1 more source
Kaleidoscopic Edge-Coloring of Complete Graphs and r-Regular Graphs
Discussiones Mathematicae Graph Theory, 2019 For an r-regular graph G, we define an edge-coloring c with colors from {1, 2, . . . , k}, in such a way that any vertex of G is incident with at least one edge of each color. The multiset-color cm(v) of a vertex v is defined as the ordered tuple (a1, a2,
Li Xueliang, Zhu Xiaoyu
doaj +1 more source
Rainbow Connection Number of Graphs with Diameter 3
Discussiones Mathematicae Graph Theory, 2017 A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every pair of distinct vertices of G
Li Hengzhe, Li Xueliang, Sun Yuefang
doaj +1 more source
Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We study the number of encryptions necessary to revoke a set of users in the complete subtree scheme (CST) and the subset-difference scheme (SD). These are well-known tree based broadcast encryption schemes.
Christopher Eagle +4 more
doaj +1 more source
Ward identities and combinatorics of rainbow tensor models [PDF]
, 2017 A bstractWe discuss the notion of renormalization group (RG) completion of non-Gaussian Lagrangians and its treatment within the framework of Bogoliubov-Zimmermann theory in application to the matrix and tensor models.
H. Itoyama +3 more
semanticscholar +1 more source