Results 1 to 10 of about 376,211 (120)
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
General Properties on Differential Sets of a Graph
Axioms, 2021 Let G=(V,E) be a graph, and let β∈R. Motivated by a service coverage maximization problem with limited resources, we study the β-differential of G. The β-differential of G, denoted by ∂β(G), is defined as ∂β(G):=max{|B(S)|−β|S|suchthatS⊆V}.
Ludwin A. Basilio +3 more
doaj +1 more source
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 +1 more source
Spanning k-Ended Tree in 2-Connected Graph
Axioms, 2023 Win proved a very famous conclusion that states the graph G with connectivity κ(G), independence number α(G) and α(G)≤κ(G)+k−1(k≥2) contains a spanning k-ended tree. This means that there exists a spanning tree with at most k leaves.
Wanpeng Lei, Jun Yin
doaj +1 more source
Matching Number, Independence Number, and Covering Vertex Number of Γ(Zn)
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 +1 more source
New Bounds for the α-Indices of Graphs
Mathematics, 2020 Let G be a graph, for any real 0≤α≤1, Nikiforov defines the matrix Aα(G) as Aα(G)=αD(G)+(1−α)A(G), where A(G) and D(G) are the adjacency matrix and diagonal matrix of degrees of the vertices of G.
Eber Lenes +2 more
doaj +1 more source
Shor’s bounds for the weighted independence number
Науковий вісник Ужгородського університету. Серія: Математика і інформатика, 2019 Application of a technique of dual Lagrangian quadratic bounds of N.Z. Shor to studying the Maximum Weighted Independent Set problem is described. By the technique, two such N.Z. Shor’s upper bounds are obtained.
П. І. Стецюк +1 more
doaj +1 more source
On the k-Component Independence Number of a Tree
Discrete Dynamics in Nature and Society, 2021 Let G be a graph and k≥1 be an integer. A subset S of vertices in a graph G is called a k-component independent set of G if each component of GS has order at most k.
Shuting Cheng, Baoyindureng Wu
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
Further Results on Packing Related Parameters in Graphs
Discussiones Mathematicae Graph Theory, 2022 Given a graph G = (V, E), a set B ⊆ V (G) is a packing in G if the closed neighborhoods of every pair of distinct vertices in B are pairwise disjoint. The packing number ρ(G) of G is the maximum cardinality of a packing in G. Similarly, open packing sets
Mojdeh Doost Ali +2 more
doaj +1 more source