Results 61 to 70 of about 240,213 (310)
, 2018 This monograph aims to promote original mathematical methods to determine the invariant measure of two-dimensional random walks in domains with boundaries.
G. Fayolle +2 more
semanticscholar +1 more source
Signature Catalan combinatorics [PDF]
Journal of Combinatorics, 2018 The Catalan numbers constitute one of the most important sequences in combinatorics. Catalan objects have been generalized in various directions, including the classical Fuss-Catalan objects and the rational Catalan generalization of Armstrong-Rhoades ...
Cesar Ceballos +1 more
semanticscholar +1 more source
Journal of Combinatorial Designs, EarlyView.ABSTRACT We investigate the lazy burning process for Latin squares by studying their associated hypergraphs. In lazy burning, a set of vertices in a hypergraph is initially burned, and that burning spreads to neighboring vertices over time via a specified propagation rule.
Anthony Bonato +3 more
wiley +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
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
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
Journal of Graph Theory, EarlyView.ABSTRACT Given a hypergraph H ${\rm{ {\mathcal H} }}$, the dual hypergraph of H ${\rm{ {\mathcal H} }}$ is the hypergraph of all minimal transversals of H ${\rm{ {\mathcal H} }}$. The dual hypergraph is always Sperner, that is, no hyperedge contains another.
Endre Boros +3 more
wiley +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
Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems
Journal of Graph Theory, EarlyView.ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh +2 more
wiley +1 more source
Combinatorics and Physics [PDF]
, 2011 Item does not contain ...
Ebrahimi-Fard, K. +2 more
openaire +3 more sources
A note on global existence for boundary value problems
International Journal of Mathematics and Mathematical Sciences, 1989 Upper and lower solutions are used in establlsning global existence results for certain two–point boundary value problems for y‴=f(x,y,y′,y″) and y(n)=f(x,y,y′,...,y(n−1)).
Chuan J. Chyan, Johnny Henderson
doaj +1 more source