Zobrazeno 1 - 10
of 10 612
pro vyhledávání: '"Independent set"'
Autor:
Zhiren Sun, Sizhong Zhou
Publikováno v:
Discrete Mathematics Letters, Vol 12, Pp 154-158 (2023)
Externí odkaz:
https://doaj.org/article/7bd6d511c48740a1b4ef67c4c6740e90
Autor:
Nhu An Do, Quang Tuan Nguyen
Publikováno v:
Tạp chí Khoa học Đại học Đà Lạt, Vol 14, Iss 3 (2024)
Let G be an undirected simple graph on \(n \geq 3\) vertices with the degree sum of any two nonadjacent vertices in G equal to \(n - 2\). We determine the condition for G to be a Hamiltonian graph.
Externí odkaz:
https://doaj.org/article/ed4ab2ddb6464be1a7a3e8b23486946b
Publikováno v:
Mathematics, Vol 12, Iss 6, p 872 (2024)
In this manuscript, we introduce a few new types of dominations in intuitionistic fuzzy directed graphs (IFDGs) based on different types of strong arcs (SAs). Our work is not only a direct extension of domination in directed fuzzy graphs (DFGs) but a
Externí odkaz:
https://doaj.org/article/39b6edc7483346258fe42262363fc80a
Autor:
Borg Peter, Feghali Carl
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 1, Pp 277-286 (2023)
A family 𝒜 of sets is said to be intersecting if every two sets in 𝒜 intersect. An intersecting family is said to be trivial if its sets have a common element. A graph G is said to be r-EKR if at least one of the largest intersecting families o
Externí odkaz:
https://doaj.org/article/b1bd7e64ea73458bac8ee3e092dd4711
Publikováno v:
IEEE Access, Vol 11, Pp 142979-142991 (2023)
Correlation-diversified portfolios can be constructed by finding the maximum independent sets (MISs) in market graphs with edges corresponding to correlations between two stocks. The computational complexity of finding the MIS increases exponentially
Externí odkaz:
https://doaj.org/article/1379b0f5731d4437a39d703f7df8b110
Autor:
Shuting Cheng, Baoyindureng Wu
Publikováno v:
AIMS Mathematics, Vol 7, Iss 7, Pp 13537-13562 (2022)
Let $ G = (V(G), E(G)) $ be a graph. For a positive integer $ k $, we call $ S\subseteq V(G) $ a $ k $-component independent set of $ G $ if each component of $ G[S] $ has order at most $ k $. Moreover, $ S $ is maximal if there does not exist a $ k
Externí odkaz:
https://doaj.org/article/ada60260d99040daa5e2cc996f3446fc
Publikováno v:
Contributions to Mathematics, Vol 7, Pp 1-10 (2022)
Externí odkaz:
https://doaj.org/article/f59d428af1194a07ac483ace4447661d
Autor:
Deepti Jain, Purnima Gupta
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 3, Pp 201-205 (2022)
AbstractA set D of vertices in a connected graph G is said to be an independent 2-point set dominating set (or in short i-2psd set) of G if D is an independent set and for every non-empty subset [Formula: see text] there exists a non-empty subset [Fo
Externí odkaz:
https://doaj.org/article/d72536e52fde4e0c979bdaea9e43bab6
Autor:
Valentin E. Brimkov, Reneta P. Barneva
Publikováno v:
Mathematics, Vol 12, Iss 2, p 170 (2024)
In 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. The problems of finding a maximum clique and a maximum independent s
Externí odkaz:
https://doaj.org/article/4768dfc5c2384c8dacc14a93e4cdd595