A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We study the concept of strong equality of domination parameters. ... A constructive characterization of the trees T for which (T ) = t (T ), where t (T ) denotes the total domination number of T , is also presented. ... This motivates the deÿnition of strong equality of parameters (see [3, 4] ). ...doi:10.1016/s0012-365x(02)00451-x fatcat:bdignvioj5abrisjidnkso63zm
We study the concept of strong equality of majority domination parameters. ... Let 1 P and 2 P be properties of vertex subsets of a graph, and assume that every subset of () VG with property 2 P also has property 1 ... If the degree of a vertex v satisfies ( ) 1 2 p dv , then the vertex () v V G is called a majority dominating vertex of G. II. Strong equality of Majority domination Parameters. ...doi:10.9790/5728-10558995 fatcat:x3zkau7l2bde3h7uvs4ctoeejm
In this paper we explore graphs having same domination number and independent domination number . Such graphs are denoted as ( , )-graphs. Several families of ( , )-graphs have been constructed. ... Furthermore, properties of graphs in which every -set is a -set has been investigated. ... Strong equality between and i This section deals with the concept called strong equality of domination number and independent domination number in graphs. ...doi:10.12723/mjs.34.4 fatcat:kjw5ujmztjae7hew7c2iwciok4
A dominating set $S$ of a graph $G$ is a global (strong) defensive alliance if for every vertex $v\in S$, the number of neighbors $v$ has in $S$ plus one is at least (greater than) the number of neighbors ... The dominating set $S$ is a global (strong) offensive alliance if for every vertex $v\in V\setminus S$, the number of neighbors $v$ has in $S$ is at least (greater than) the number of neighbors it has ... They also noticed that for trees T , the independence domination number i is "incomparable" to some global alliance parameters in that sense that i(T ) can be smaller than γ a (T ) or γ o (T ), or greater ...doi:10.37236/847 fatcat:tffdj7juxfdenmrlfmbvrkfq6m
We characterize trees with domination number equal to twice edge domination number. ... The domination number of a graph \(G\), denoted by \(\gamma(G)\) is the minimum cardinality of a dominating set of \(G\). ... Acknowledgements The authors thank the anonymous referees for their helpful and constructive comments leading to improvements in the presentation of the paper. ...doi:10.15826/umj.2020.1.012 fatcat:4kryx3ak4rbvvkxckdnisjnbny
parameters are equal for inflated trees. ... We provide a constructive characterisation of those trees with equal domination and restrained domination numbers. ...
We then present the strong equality of hop domination and hop independent domination numbers for trees. Hop domination numbers of shadow graph and mycielskian graph of graph are also discussed. ... In this paper we characterize the family of trees and unicyclic graphs for which γh(G) = γt(G) and γh(G) = γc(G) where γt(G) and γc(G) are the total domination and connected domination numbers of G respectively ... Figure 4: G 1 Figure 5 : 5 G 2 2.3 Strong equality of hop domination and hop independent domination numbers In , Haynes et al. obtained strong equality of domination number and other domination parameters ...doi:10.1515/auom-2015-0036 fatcat:k5bskmbv35bx3hfi7uln4vugeq
Physics Letters B
A robust test of the standard model vs. new physics is its prediction of equal direct CP violation in B_s → K^- π^+ decay. ... But in the standard model a miracle occurs and the interfering tree diagram is enhanced by the same CKM factor that reduces the penguin to give the predicted equality. ... ACKNOWLEDGEMENTS This research was supported in part by the U.S. Department of Energy, Division of High Energy Physics, Contract W-31-109-ENG-38. ...doi:10.1016/j.physletb.2005.06.023 fatcat:kl2km7ijj5f7vl26js5cheok44
For instance, we establish upper bounds for such parameter, and relate it with several parameters related to vertex domination in graphs, from which we remark the standard domination number, the total ... The total version of one strong Roman dominating function includes the additional property concerning the not existence of vertices of degree zero in the subgraph of G, induced by the set of vertices labeled ... Trees In this section, we present two bounds for the total strong Roman domination number of trees. ...arXiv:1912.01093v1 fatcat:e56v4bqmtndxbpzmyxgdnubehq
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numbers. ... We also consider a general framework for constructive characterizations for other equality problems. ...  provided a constructive characterization of those trees with strong equality: that is, where every -set is an i-set. ...doi:10.1016/j.disc.2006.04.031 fatcat:swid47lxkbfppeib46d7lfeb3e
The Journal of Applied Ecology
Among WbV S.D.elevation had a strong negative effect in Swaziland but a strong positive effect in Linyanti. ... Trees equal in height or taller than the surrounding vegetation were preferred, with no difference in response to these two categories (G = 1-9, d.f. = I, P > 0-1). ...
Exact values of some standard graphs, bounds and the relationship of this parameter with other graph theoretic graph parameters are evaluated. ... Keywords: Inverse Domination number of the jump graph of a graph, Inverse Connected Cototal Dominating set of a jump graph, Inverse Connected Cototal Domination number of a jump graph, Disjoint Connected ... , various domination parameters have been defined. ...doi:10.32622/ijrat.71201938 fatcat:26gf3d4n3nf3bnvrimciyluzfa
Seven plant functional groups were considered, describing major differences in structure and function: epiphytes; climbers; ferns; herbs; shrubs; coniferous trees; and angiosperm trees. ... Our results support the prediction that future climate change and anthropogenic pressures could shift geographical patterns in dominance of plant functional groups, with probable consequences for ecosystem ... the State of California. ...doi:10.1111/boj.12362 fatcat:kcsgeudyzjcbbivyq6r5chfeqa
Strong correlations have been found between the Shannon index and the Mingling index, between the Gini index and the Diameter differentiation index, and between size dominance indices. ... The analysis of correlation can guide their selection in research applications and forest management, avoiding redundancies and loss of time during data collection. ... When Ti is equal to 0, the reference tree and its neighbors have the equal diameter size. ...doi:10.3390/f12121645 fatcat:po75zof5qranng2ui7sdubhqcq
A set D of vertices in a graph G = (V, E) is a total dominating set if every vertex of G is adjacent to some vertex in D. . ... The strong total domination number γ st (G) of G is the minimum cardinality of a strong total dominating set of G. We present some bounds on weak and strong total domination number of a graph. ... Sharp bounds on the strong total domination number in trees Chellali et al. ...doi:10.5614/ejgta.2016.4.1.10 fatcat:3gj4fctlkzdflerdatres33m4y
« Previous Showing results 1 — 15 out of 186,247 results