Results 41 to 50 of about 983,866 (300)
Weighted Domination of Independent Sets [PDF]
Graphs and Combinatorics, 2019 The {\em independent domination number} $γ^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 \cite{abz} that in chordal graphs $γ^i$ is equal to $γ$, the ordinary domination number.
Ron Aharoni, Irina Gorelik
openaire +3 more sources
Neutrosophic Sets and Systems [PDF]
, 2013 Neutrosophic Sets and Systems has been created for publications on advanced studies in neutrosophy, neutrosophic set, neutrosophic logic, neutrosophic probability, neutrosophic statistics that started in 1995 and their applications in any field, such as ...
Smarandache, Florentin (Editor-in-Chief)
core +1 more source
Independent Sets In Association Schemes [PDF]
Combinatorica, 2006 15 pages; This is the corrected version that will appear in ...
Chris D. Godsil, Michael W. Newman
openaire +2 more sources
Counting Independent Sets in Cocomparability Graphs [PDF]
, 2019 We show that the number of independent sets in cocomparability graphs can be counted in linear time, as can counting cliques in comparability graphs. By contrast, counting cliques in cocomparability graphs and counting independent sets in comparability ...
Dyer, M, Müller, H
core +1 more source
Independent sets in the hypercube revisited [PDF]
, 2020 We revisit Sapozhenko's classic proof on the asymptotics of the number of independent sets in the discrete hypercube $\{0,1\}^d$ and Galvin's follow-up work on weighted independent sets.
Perkins, Will +1 more
core +1 more source
Fibonacci number of the tadpole graph
Electronic Journal of Graph Theory and Applications, 2014 In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number F(n+2) and the Fibonacci number of the cycle ...
Joe DeMaio, John Jacobson
doaj +1 more source
Extremal Independent Set Reconfiguration
The Electronic Journal of Combinatorics, 2023 The independent set reconfiguration problem asks whether one can transform one given independent set of a graph into another, by changing vertices one by one in such a way the intermediate sets remain independent. Extremal problems on independent sets are widely studied: for example, it is well known that an $n$-vertex graph has at most $3^{n/3 ...
Bousquet, Nicolas +3 more
openaire +2 more sources
Note on independent sets of a graph [PDF]
, 1994 summary:Let the number of $k$-element sets of independent vertices and edges of a graph $G$ be denoted by $n(G,k)$ and $m(G,k)$, respectively. It is shown that the graphs whose every component is a circuit are the only graphs for which the equality $n(G ...
Ivančo, Jaroslav
core +1 more source
Independent sets in graphs with an excluded clique minor [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Graphs and ...
David R. Wood
doaj +3 more sources
Approximation Algorithms for Graph Partition into Bounded Independent Sets
Tsinghua Science and Technology, 2023 The partition problem of a given graph into three independent sets of minimizing the maximum one is studied in this paper. This problem is NP-hard, even restricted to bipartite graphs.
Jingwei Xie +3 more
doaj +1 more source