Results 31 to 40 of about 10,037,549 (314)
ISDC Reflections on Emerging One CGIAR Research Portfolio and Investment Plan [PDF]
, 2021 The Executive Management Team (EMT) requested the Independent Science for Development Council (ISDC) to comment on the preliminary set of Research Initiatives.
CGIAR Independent Science for Development Council
core
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 +4 more sources
On the number of maximum independent sets of graphs [PDF]
Transactions on Combinatorics, 2014 Let $G$ be a simple graph. An independent set is a set of pairwise non-adjacent vertices. The number of vertices in a maximum independent set of $G$ is denoted by $alpha(G)$. In this paper, we characterize graphs $G$ with $n$ vertices and with maximum
Tajedin Derikvand, Mohammad Reza Oboudi
doaj
Price-forming factors choice grounding at intangible assets with negative depreciation independent valuation/appraising [PDF]
, 2020 Independent expert valuation/appraising of intellectual property rights objects, such as brands and goodwill, performed by the Costs approach, is based on economic indicators of these intangible assets utility degree, which are connected with the sum of ...
Zoryana, Skybinska +2 more
core +1 more source
The Hilton-Spencer Cycle Theorems Via Katona’s Shadow Intersection Theorem
Discussiones Mathematicae Graph Theory, 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.
Borg Peter, Feghali Carl
doaj +1 more source
Edge Metric Dimension and Edge Basis of One-Heptagonal Carbon Nanocone Networks
IEEE Access, 2022 A molecular (chemical) graph is a simple connected graph, where the vertices represent the compound’s atoms and the edges represent bonds between the atoms, and the degree (valence) of every vertex (atom) is not more than four.
Karnika Sharma +2 more
doaj +1 more source
Making a Dominating Set of a Graph Connected
Discussiones Mathematicae Graph Theory, 2018 Let G = (V,E) be a graph and S ⊆ V. We say that S is a dominating set of G, if each vertex in V \ S has a neighbor in S. Moreover, we say that S is a connected (respectively, 2-edge connected or 2-connected) dominating set of G if G[S] is connected ...
Li Hengzhe, Wu Baoyindureng, Yang Weihua
doaj +1 more source
Minimum Neighborhood of Alternating Group Graphs
IEEE Access, 2019 The minimum neighborhood and combinatorial property are two important indicators of fault tolerance of a multiprocessor system. Given a graph G, θG(q) is the minimum number of vertices adjacent to a set of q vertices of G (1 ≤ q ≤ |V(
Yanze Huang +3 more
doaj +1 more source
On the Independence Number of Cayley Digraphs of Clifford Semigroups
Mathematics, 2023 Let S be a Clifford semigroup and A a subset of S. We write Cay(S,A) for the Cayley digraph of a Clifford semigroup S relative to A. The (weak, path, weak path) independence number of a graph is the maximum cardinality of an (weakly, path, weakly path ...
Krittawit Limkul, Sayan Panma
doaj +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