Results 91 to 100 of about 193 (154)

Dominating Sets Whose Closed Stars Form Spanning Trees

open access: yes, 1995
For a subset W of vertices of an undirected graph G, let S(W ) be the subgraph consisting of W , all edges incident to at least one vertex in W , and all vertices adjacent to at least one vertex in W .
Jerrold W. Grossman
core  

Inducibility of topological trees

open access: yes, 2019
Trees without vertices of degree 2 are sometimes named topological trees. In this work, we bring forward the study of the inducibility of (rooted) topological trees with a given number of leaves.
Dossou-Olory, Audace A.V.   +1 more
core  

A tree-cotree splitting for the construction of divergence-free finite elements: the high-order case [PDF]

open access: yes, 2019
We extend, to Raviart-Thomas finite elements of any degree, two methods for the construction of basis of the space of divergence-free functions that are well established in the case of degree one.
Camano, Jessica   +3 more
core  

The Isomorphism Problem for Catalan Families

open access: yes, 1995
: Given two sets of configurations S and T (defined by some geometric or algebraic rules) with weightfunctions !S : S ! IIN and ! T : T ! IIN respectively. Suppose S and T are equipotent, i.e. j! \Gamma1 S (n)j = j!
To Prof   +3 more
core  

The hybrid number of a ploidy profile. [PDF]

open access: yesJ Math Biol, 2022
Huber KT, Maher LJ.
europepmc   +1 more source

Some Results on the Structure of Multipoles in the Study of Snarks ∗

open access: yes, 2014
AMS classification: 05C15, 05C05, 05C38. Multipoles are the pieces we obtain by cutting some edges of a cubic graph. As a result of the cut, a multipole M has dangling edges with one free end, which we call semiedges.
J. Vilaltella, M. A. Fiol
core  

Multivariate Asymptotics for Products of Large Powers with Applications to Lagrange Inversion

open access: yes, 1999
An asymptotic estimate is given for the coefficients of products of large powers of generating functions. This theorem and another local limit theorem which is useful for conditioning are applied to various combinatorial enumeration problems that involve
Edward A. Bender, L. Bruce Richmond
core  

Home - About - Disclaimer - Privacy