نتایج جستجو برای: signed total roman k
تعداد نتایج: 1176208 فیلتر نتایج به سال:
a {em roman dominating function} on a graph $g = (v ,e)$ is a function $f : vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. the {em weight} of a roman dominating function is the value $w(f)=sum_{vin v}f(v)$. the roman domination number of a graph $g$, denoted by $gamma_r(g)$, equals the...
Roman K Thomas1,2,12, Elizabeth Nickerson3,12, Jan F Simons3,11, Pasi A Jänne1, Torstein Tengs1,2, Yuki Yuza1, Levi A Garraway1,2,4, Thomas LaFramboise1,2, Jeffrey C Lee1,2, Kinjal Shah1,2, Keith O’Neill2, Hidefumi Sasaki5, Neal Lindeman6, Kwok-Kin Wong1, Ana M Borras7, Edward J Gutmann8, Konstantin H Dragnev9, Ralph DeBiasi1,2, Tzu-Hsiu Chen1,2, Karen A Glatt1, Heidi Greulich1,2, Brian Desany3...
in this paper, we define the common minimal common neighborhooddominating signed graph (or common minimal $cn$-dominating signedgraph) of a given signed graph and offer a structuralcharacterization of common minimal $cn$-dominating signed graphs.in the sequel, we also obtained switching equivalencecharacterization: $overline{sigma} sim cmcn(sigma)$, where$overline{sigma}$ and $cmcn(sigma)$ are ...
A signed graph is a whose edges are labeled either positive or negative. Corresponding to the two distance matrices defined for graphs, we define laplacian matrices. We characterize balance in graphs using these and find spectra of some classes unbalanced graphs.
For any integer $kgeq 1$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple total dominating set of $G$ if any vertex of $G$ is adjacent to at least $k$ vertices in $S$, and any vertex of $V-S$ is adjacent to at least $k$ vertices in $V-S$. The minimum number of vertices of such a set in $G$ we call the $k$-tuple total restrained domination number of $G$. The maximum num...
A 2-edge-colored graph or a signed is simple with two types of edges. homomorphism from G to H mapping φ:V(G)→V(H) that maps every edge in an the same type H. Switching vertex v corresponds changing each incident v. There if after switching some subset vertices there The chromatic number (resp. signed) order smallest such class graphs maximum numbers class. We study and (connected not necessari...
We present a survey of con uence properties of (acyclic) term graph rewriting. Results and counterexamples are given for di erent kinds of term graph rewriting: besides plain applications of rewrite rules, extensions with the operations of collapsing and copying, and with both operations together are considered. Collapsing and copying together constitute bisimilarity of term graphs. We establis...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید