Sign Up to like & get
recommendations!
1
Published in 2020 at "Pattern Recognition"
DOI: 10.1007/978-3-030-49076-8_6
Abstract: The problem of counting the number of independent sets of a graph G (denoted as i(G)) is a classic #P-complete problem. We present some patterns on graphs that allows us the polynomial computation of i(G).…
read more here.
Keywords:
graphs;
computation;
pattern;
number independent ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2019 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-019-02024-3
Abstract: The independent domination number$$\gamma ^i(G)$$γi(G) of a graph G is the maximum, over all independent sets I, of the minimal number of vertices needed to dominate I. It is known (Aharoni et al. in Combinatorica…
read more here.
Keywords:
weighted domination;
number;
domination independent;
domination ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-015-9960-0
Abstract: A caterpillar graph is a tree which on removal of all its pendant vertices leaves a chordless path. The chordless path is called the backbone of the graph. The edges from the backbone to the…
read more here.
Keywords:
sets generalisation;
maximal independent;
generalisation caterpillar;
graph ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2022 at "Chemical Science"
DOI: 10.1039/d2sc01057g
Abstract: NMR spectroscopy in anisotropic media has emerged as a powerful technique for the structural elucidation of organic molecules. Its application requires weak alignment of analytes by means of suitable alignment media. Although a number of…
read more here.
Keywords:
alignment media;
organic solvents;
residual dipolar;
sets residual ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2018 at "Journal of Applied and Industrial Mathematics"
DOI: 10.1134/s1990478918020175
Abstract: Given n and d, we describe the structure of trees with the maximal possible number of greatest independent sets in the class of n-vertex trees of vertex degree at most d.We show that the extremal…
read more here.
Keywords:
bounded degree;
greatest independent;
trees bounded;
number greatest ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2017 at "Mathematica Slovaca"
DOI: 10.1515/ms-2016-0293
Abstract: Abstract The concept of conditionally independent sets is introduced in this article. Its link with the concept of the conditional probability and with the concept of a system of independent sets is described here. Furthermore,…
read more here.
Keywords:
conditionally independent;
independent sets;
system;
systems conditionally ... See more keywords