Results 61 to 70 of about 167 (98)

Further results on enumeration of perfect matchings of Cartesian product graphs

Open Mathematics
Counting perfect matchings is an interesting and challenging combinatorial task. It has important applications in statistical physics and chemistry. As the general problem is #P-complete, it is usually tackled by randomized heuristics and approximation ...
Wu Tingzeng, Zeng Xiaolin
doaj   +1 more source

Disjoint triangles and quadrilaterals in a graph

Open Mathematics, 2008
Wang Hong
doaj   +1 more source

BINDING NUMBERS AND FRACTIONAL (g, f, n)-CRITICAL GRAPHS

, 2016
Sizhong Zhou, Zhiren Sun
semanticscholar   +1 more source

RESTRAINED LICT DOMINATION IN GRAPHS

, 2014
M. H. Muddebihal
semanticscholar   +1 more source

$M_2$-EDGE COLORING AND MAXIMUM MATCHING OF GRAPHS

, 2013
J. Czap
semanticscholar   +1 more source

Rectangular table negotiation problem revisited

Open Mathematics, 2011
Froncek Dalibor, Kubesa Michael
doaj   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Total Strong Litact Domination in Graphs

, 2021
In this paper, a new domination number called total strong litact domination number is defined on a graph and values of the defined variant to standard graphs, general graphs, trees etc., are acquired and endeavoured to raise a association among the ...
R. Avvari, Vani Manda, Ramprasad Chegu
semanticscholar   +1 more source

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, J. V. Kureethara, S. Naduvath, C. Dominic   +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