Domination Number, Independent Domination Number and 2-Independence Number in Trees
Discussiones Mathematicae Graph Theory, 2021 For a graph G, let γ(G) be the domination number, i(G) be the independent domination number and β2(G) be the 2-independence number. In this paper, we prove that for any tree T of order n ≥ 2, 4β2(T) − 3γ(T) ≥ 3i(T), and we characterize all trees ...
Dehgardi Nasrin +4 more
doaj +2 more sources
Matching Number, Independence Number, and Covering Vertex Number of Γ(Zn) [PDF]
Mathematics, 2019 Graph invariants are the properties of graphs that do not change under graph isomorphisms, the independent set decision problem, vertex covering problem, and matching number problem are known to be NP-Hard, and hence it is not believed that there are ...
Eman AbuHijleh +3 more
doaj +2 more sources
ON THE GIRTH, INDEPENDENCE NUMBER, AND WIENER INDEX OF COPRIME GRAPH OF DIHEDRAL GROUP
Barekeng, 2023 The coprime graph of a finite group , denoted by , is a graph with vertex set such that two distinct vertices and are adjacent if and only if their orders are coprime, i.e., where |x| is the order of x.
Agista Surya Bawana +2 more
doaj +3 more sources
Bounds for the Independence Number in $k$-Step Hamiltonian Graphs [PDF]
Computer Science Journal of Moldova, 2018 For a given integer $k$, a graph $G$ of order $n$ is called $k$-step Hamiltonian if there is a labeling $v_1,v_2,...,v_n$ of vertices of $G$ such that $d(v_1,v_n)=d(v_i,v_{i+1})=k$ for $i=1,2,...,n-1$.
Noor A'lawiah Abd Aziz +3 more
doaj +1 more source
Bounds on the Clique and the Independence Number for Certain Classes of Graphs [PDF]
MathematicsIn this paper, we study the class of graphs Gm,n that have the same degree sequence as two disjoint cliques Km and Kn, as well as the class G¯m,n of the complements of such graphs.
Valentin E. Brimkov, Reneta P. Barneva
doaj +2 more sources
Treewidth versus clique number. II. Tree-independence number
Journal of Combinatorial Theory, Series B, 2023 In 2020, we initiated a systematic study of graph classes in which the treewidth can only be large due to the presence of a large clique, which we call $(\mathrm{tw},ω)$-bounded. While $(\mathrm{tw},ω)$-bounded graph classes are known to enjoy some good algorithmic properties related to clique and coloring problems, it is an interesting open problem ...
Clément Dallard +2 more
openalex +3 more sources
The Critical Independence Number and an Independence Decomposition [PDF]
European Journal of Combinatorics, 2009 10 pages, 4 ...
C. E. Larson
openalex +4 more sources
Clique immersions and independence number [PDF]
European Journal of Combinatorics, 2022 13 pages, 1 figure.
Sebastián Bustamante +3 more
openalex +4 more sources
Tree decompositions with bounded independence number: beyond independent sets [PDF]
, 2022 We continue the study of graph classes in which the treewidth can only be large due to the presence of a large clique, and, more specifically, of graph classes with bounded tree-independence number. In [Dallard, Milanič, and Štorgel, Treewidth versus clique number. {II}.
Martin Milanič, Paweł Rzążewski
openalex +3 more sources
Discontinuity and diversity of Persian scientific research journals in the field of educational sciences by using coloring and mathematical algebraic parameters [PDF]
ریاضی و جامعه, 2022 The aim of the current research is to study and compare graphs authorship by Iranian researchers in Persian scientific research journals in the field of educational sciences by using algebraic parameters of mathematics. In this research, the data related
Ali Abdi, Mostafa Amini
doaj +1 more source