Results 31 to 40 of about 147,491 (227)
List circular backbone colouring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A natural generalization of graph colouring involves taking colours from a metric space and insisting that the endpoints of an edge receive colours separated by a minimum distance dictated by properties of the edge.
Frederic Havet, Andrew D. King
doaj +1 more source
, 2004 This article is not a research paper, but a little note on the history of combinatorics: We present here a tentative short biography of Henri Delannoy, and a survey of his most notable works.
Aeppli +70 more
core +5 more sources
Correlative Imaging Platform Linking Taste Cell Function to Molecular Identity
Advanced Science, EarlyView.A correlative imaging platform is developed to study how individual taste cells respond to different taste qualities. By linking cellular activity with molecular identity and environmental context, dual‐tuned taste cells capable of detecting both sweet and umami stimuli are identified.
Sungho Lee +6 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
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
On the combinatorics of sparsification [PDF]
, 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.
Christian M Reidys +2 more
core +7 more sources
Dimer models and conformal structures
Communications on Pure and Applied Mathematics, EarlyView.Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala +3 more
wiley +1 more source
Generalized Rainbow Connection of Graphs and their Complements
Discussiones Mathematicae Graph Theory, 2018 Let G be an edge-colored connected graph. A path P in G is called ℓ-rainbow if each subpath of length at most ℓ + 1 is rainbow. The graph G is called (k, ℓ)-rainbow connected if there is an edge-coloring such that every pair of distinct vertices of G is ...
Li Xueliang +3 more
doaj +1 more source
Smith Normal Form in Combinatorics [PDF]
, 2015 This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic properties and interpretations of Smith normal form, critical groups of graphs, and Smith normal form of ...
Stanley, Richard P.
core +1 more source
On the Q $Q$‐Polynomial Property of Bipartite Graphs Admitting a Uniform Structure
Journal of Combinatorial Designs, EarlyView.ABSTRACT Let Γ ${\rm{\Gamma }}$ denote a finite, connected graph with vertex set X $X$. Fix x ∈ X $x\in X$ and let ε ≥ 3 $\varepsilon \ge 3$ denote the eccentricity of x $x$. For mutually distinct scalars { θ i * } i = 0 ε ${\{{\theta }_{i}^{* }\}}_{i=0}^{\varepsilon }$ define a diagonal matrix A * = A * ( θ 0 * , θ 1 * , … , θ ε * ) ∈ Mat X ( R ) ${A}^
Blas Fernández +3 more
wiley +1 more source