Results 51 to 60 of about 46,626 (239)
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
International Journal of Mathematical Combinatorics, Vol.4 [PDF]
, 2010 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +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
On the combinatorics of sparsification [PDF]
Algorithms for Molecular Biology, 2012 Background: We study the sparsification of dynamic programming folding algorithms of RNA structures. Sparsification applies to the mfe-folding of RNA structures and can lead to a significant reduction of time complexity. Results: We analyze the sparsification of a particular decomposition rule, $Λ^*$, that splits an interval for RNA secondary and ...
Huang, Fenix Wenda, reidys, Christian
openaire +6 more sources
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
International Journal of Mathematical Combinatorics, Vol.7A [PDF]
, 2013 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
Enumeration of Gelfand-Cetlin type reduced words
, 2022 The combinatorics of reduced words and their commutation classes plays an important role in geometric representation theory. For a semisimple complex Lie group G, a string polytope is a convex polytope associated with each reduced word of the longest ...
Kim, Jang Soo +2 more
core +1 more source
Teaching Combinatorial Principles Using Relations through the Placemat Method
Mathematics, 2021 The presented paper is devoted to an innovative way of teaching mathematics, specifically the subject combinatorics in high schools. This is because combinatorics is closely connected with the beginnings of informatics and several other scientific ...
Viliam Ďuriš +3 more
doaj +1 more source
International Journal of Mathematical Combinatorics, Vol.4A [PDF]
, 2010 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
Advanced Intelligent Discovery, EarlyView.This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley +1 more source