05c70 - Open Access .click

Results 91 to 100 of about 842 (102)

Some of the next articles are maybe not open access.

On the Pendant Number of Some New Graph Classes

Research & Reviews: Discrete Mathematical Structures, 2019
A decomposition of a graph is a collection of its edge disjoint sub-graphs such that their union is . If all the sub-graphs in the decomposition are paths, then it is a path decomposition. In this paper, we discuss the pendant number, the minimum number
J. Sebastian +3 more
semanticscholar +1 more source

On the fractional matching number of the join and corona of graphs

International Mathematical Forum, 2019
A fractional matching of a graph G = (V,E) is a function f from E to the interval [0, 1] such that ∑ e∈Γ(v) f(e) ≤ 1 for every v ∈ V , where Γ(v) is the set of all edges incident to v.
Arcie S. Nogra, M. P. Baldado
semanticscholar +1 more source

Permutations avoiding connected graphs

Contributions Discret. Math., 2017
There is a permutation of the vertices of a tree for which no proper subtree on at least two vertices is mapped to a subtree, if and only if twice the number of its endpoints is less than or equal to the number of points of the tree; Theorem 4.1.
N. Sauer, I. Zaguia
semanticscholar +1 more source

Mutually orthogonal graph squares for disjoint union of paths