An edge dominating set of a graph is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number. The odd (even) sum degree edge domination number is the minimum cardinality taken over all odd (even) sum degree edge dominating sets of G and is defined as zero if no such odd (even) sum degree edge dominating set exists in G. In this paper, the odd (even) sum degree domination concept is extended on the co-dominating set E-T of a graph G, where T is an edge dominating set of G. The corresponding parameters co-odd (even) sum degree edge dominating set, co-odd (even) sum degree edge domination number and co-odd (even) sum degree edge domination value is defined. Further, the exact values of the above said parameters are found for some standard classes of graphs. The bounds of the co-odd (even) sum degree edge domination number are obtained in terms of basic graph terminologies. The co-odd (even) sum degree edge dominating sets are characterized. The relationships with other edge domination parameters are also studied.
This paper discusses the Sums of Squares of “m” consecutive Woodall Numbers. These discussions are made from the definition of Woodall numbers. Also learn the comparability of Woodall numbers and other special numbers. An attempt to communicate the formula for the sums of squares of ‘m’ Woodall numbers and its matrix form are discussed. Further, this study expresses some more correlations between Woodall numbers and other special numbers.
The aim of this paper is to introduce and study a new kind of graphs associated to an ideal of a commutative ring. Let ℛ be a commutative ring with identity, and I(ℛ) be the set of all non-trivial ideals of ℛ with S I(ℛ). The sum ideal graph associated to S, denoted by Ψ(ℛ, S), is the undirected graph with vertex set {A I(ℛ): S⊂A+B, for some B I(ℛ)} where two ideal vertices A and B are adjacent if and only if A B and S⊂A+B. In this paper we establish some of characterizations and results of this kind of graph with providing some examples.
This paper deals the prediction of the process of random spatial data of two properties, the first is called Primary variables and the second is called secondary variables , the method that were used in the prediction process for this type of data is technique Co-kriging , the method is usually used when the number of primary variables meant to predict for one of its elements is measured in a particular location a few (because of the cost or difficulty of obtaining them) compare with secondary variable which is the number of elements are available and highly correlated with primary variables, as was the&nbs
... Show MoreF index is a connected graph, sum of the cubes of the vertex degrees. The forgotten topological index has been designed to be employed in the examination of drug molecular structures, which is extremely useful for pharmaceutical and medical experts in understanding the biological activities. Among all the topological indices, the forgotten index is based on degree connectivity on bonds. This paper characterized the forgotten index of union of graphs, join graphs, limits on trees and its complements, and accuracy is measured. Co-index values are analyzed for the various molecular structure of chemical compounds
A total global dominator coloring of a graph is a proper vertex coloring of with respect to which every vertex in dominates a color class, not containing and does not dominate another color class. The minimum number of colors required in such a coloring of is called the total global dominator chromatic number, denoted by . In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored.
The rise of edge-cloud continuum computing is a result of the growing significance of edge computing, which has become a complementary or substitute option for traditional cloud services. The convergence of networking and computers presents a notable challenge due to their distinct historical development. Task scheduling is a major challenge in the context of edge-cloud continuum computing. The selection of the execution location of tasks, is crucial in meeting the quality-of-service (QoS) requirements of applications. An efficient scheduling strategy for distributing workloads among virtual machines in the edge-cloud continuum data center is mandatory to ensure the fulfilment of QoS requirements for both customer and service provider. E
... Show MoreThe rotational model symmetry is a strong feature of 1d shell nuclei, where symmetry breaking spin-orbital force is rather weak. The binding energies and low-lying energy spectra of Mg (A=20,22,28 and 30) even-even isotopes have been calculated. The interaction used contains the monopole-monopole, quadrupole-quadrupole and isospin dependent terms. Interaction parameters are fixed so as to reproduce the binding of 8 nucleons in N=8 orbit for Z=12 isotope.
Ruthenium-Ruthenium and Ruthenium–ligand interactions in the triruthenium "[Ru3(μ-H)(μ3-κ2-Hamphox-N,N)(CO)9]" cluster are studied at DFT level of theory. The topological indices are evaluated in term of QTAIM (quantum theory of atoms in molecule). The computed topological parameters are in agreement with related transition metal complexes documented in the research papers. The QTAIM analysis of the bridged core part, i.e., Ru3H, analysis shows that there is no bond path and bond critical point (chemical bonding) between Ru(2) and Ru(3). Nevertheless, a non-negligible delocalization index for this non-bonding interaction is calculated
... Show MoreThe reduced electric quadrupole transition strengths B(E2) from the first excited
2+ state to the ground 0+ state of some even-even Neon isotopes (18,20,22,24,26,28Ne)
have been calculated. All studied isotopes composed of 16O nucleus that is
considered as an inert core and the other valence particles considered to move over
the sd-shell model space within 1d5/2, 2s1/2 and 1d3/2 orbits.
The configuration mixing shell model with limiting number of orbitals in the
model space outside the inert core fail to reproduce the measured electric transition
strengths. Therefore, and for the purpose of enhancing the calculations, the
discarded space has been included through a microscopic theory which considers a
particle-
Graph is a tool that can be used to simplify and solve network problems. Domination is a typical network problem that graph theory is well suited for. A subset of nodes in any network is called dominating if every node is contained in this subset, or is connected to a node in it via an edge. Because of the importance of domination in different areas, variant types of domination have been introduced according to the purpose they are used for. In this paper, two domination parameters the first is the restrained and the second is secure domination have been chosn. The secure domination, and some types of restrained domination in one type of trees is called complete ary tree are determined.