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 `application/pdf`

.

## Filters

##
###
Strong equality of domination parameters in trees

2003
*
Discrete Mathematics
*

We study the concept

doi:10.1016/s0012-365x(02)00451-x
fatcat:bdignvioj5abrisjidnkso63zm
*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] ). ...##
###
Strong Equality of MAJORITY Domination Parameters

2014
*
IOSR Journal of Mathematics
*

We study the concept

doi:10.9790/5728-10558995
fatcat:x3zkau7l2bde3h7uvs4ctoeejm
*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*. ...##
###
On Equality and Strong Equality of Domination Number and Independent Domination Number in Graphs

2015
*
Mapana Journal of Sciences
*

*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. ...

##
###
Global Alliances and Independent Domination in Some Classes of Graphs

2008
*
Electronic Journal of Combinatorics
*

A

doi:10.37236/847
fatcat:tffdj7juxfdenmrlfmbvrkfq6m
*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 ...##
###
DOMINATION AND EDGE DOMINATION IN TREES

2020
*
Ural Mathematical Journal
*

We characterize

doi:10.15826/umj.2020.1.012
fatcat:4kryx3ak4rbvvkxckdnisjnbny
*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. ...##
###
Page 1494 of Mathematical Reviews Vol. , Issue 2001C
[page]

2001
*
Mathematical Reviews
*

*parameters*are

*equal*for inflated

*trees*. ... We provide a constructive characterisation

*of*those

*trees*with

*equal*

*domination*and restrained

*domination*numbers. ...

##
###
Hop Domination in Graphs-II

2015
*
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
*

We then present the

doi:10.1515/auom-2015-0036
fatcat:k5bskmbv35bx3hfi7uln4vugeq
*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*[6], Haynes et al. obtained*strong**equality**of**domination*number and other*domination**parameters*...##
###
Is observed direct CP violation in Bd→K+π− due to new physics? Check standard model prediction of equal violation in Bs→K−π+

2005
*
Physics Letters B
*

A robust test

doi:10.1016/j.physletb.2005.06.023
fatcat:kl2km7ijj5f7vl26js5cheok44
*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. ...##
###
On the total and strong version for Roman dominating functions in graphs
[article]

2019
*
arXiv
*
pre-print

For instance, we establish upper bounds for such

arXiv:1912.01093v1
fatcat:e56v4bqmtndxbpzmyxgdnubehq
*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*. ...##
###
Construction of trees and graphs with equal domination parameters

2006
*
Discrete Mathematics
*

We provide a simple constructive characterization for

doi:10.1016/j.disc.2006.04.031
fatcat:swid47lxkbfppeib46d7lfeb3e
*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. ... [10] provided a constructive characterization*of*those*trees*with*strong**equality*: that is, where every -set is an i-set. ...##
###
Page 857 of The Journal of Applied Ecology Vol. 46, Issue 4
[page]

2009
*
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). ...##
###
Inverse and Disjoint Connected Cototal Domination number of the Jump Graph of a Graph

2019
*
International Journal of Research in Advent Technology
*

Exact values

doi:10.32622/ijrat.71201938
fatcat:26gf3d4n3nf3bnvrimciyluzfa
*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. ...##
###
Patterns and drivers of plant functional group dominance across the Western Hemisphere: a macroecological re-assessment based on a massive botanical dataset

2015
*
Botanical journal of the Linnean Society
*

Seven plant functional groups were considered, describing major differences

doi:10.1111/boj.12362
fatcat:kcsgeudyzjcbbivyq6r5chfeqa
*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. ...##
###
Exploring Correlation between Stand Structural Indices and Parameters across Three Forest Types of the Southeastern Italian Alps

2021
*
Forests
*

*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. ...

##
###
Bounds on weak and strong total domination in graphs

2016
*
Electronic Journal of Graph Theory and Applications
*

A set D

doi:10.5614/ejgta.2016.4.1.10
fatcat:3gj4fctlkzdflerdatres33m4y
*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. ...
« Previous

*Showing results 1 — 15 out of 186,247 results*