نتایج جستجو برای: total graph

تعداد نتایج: 988065  

Journal: :transactions on combinatorics 2015
adel p. kazemi

given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...

Abbas Shariatnia Abolfazl Tehranian,

 Let $R$ be a commutative ring and $M$ be an $R$-module with $T(M)$ as subset, the set of torsion elements. The total graph of the module denoted by $T(Gamma(M))$, is the (undirected) graph with all elements of $M$ as vertices, and for distinct elements $n,m in M$, the vertices $n$ and $m$ are adjacent if and only if $n+m in T(M)$. In this paper we study the domination number of $T(Gamma(M))$ a...

Let £ be a $0$-distributive lattice with the least element $0$, the greatest element $1$, and ${rm Z}(£)$ its set of zero-divisors. In this paper, we introduce the total graph of £, denoted by ${rm T}(G (£))$. It is the graph with all elements of £ as vertices, and for distinct $x, y in £$, the vertices $x$ and $y$ are adjacent if and only if $x vee y in {rm Z}(£)$. The basic properties of the ...

Abolfazl Tehranian, Hamid Reza Maimani,

Let R be a commutative ring with $Z(R)$ its set of zero-divisors. In this paper, we study the total graph of $R$, denoted by $T(Gamma(R))$. It is the (undirected) graph with all elements of R as vertices, and for distinct $x, yin R$, the vertices $x$ and $y$ are adjacent if and only if $x + yinZ(R)$. We study the chromatic number and edge connectivity of this graph.

A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

Journal: :transactions on combinatorics 2012
h. aram s.m. sheikholeslami l. volkmann

‎a set $s$ of vertices of a graph $g=(v,e)$ without isolated vertex‎ ‎is a {em total dominating set} if every vertex of $v(g)$ is‎ ‎adjacent to some vertex in $s$‎. ‎the {em total domatic number} of‎ ‎a graph $g$ is the maximum number of total dominating sets into‎ ‎which the vertex set of $g$ can be partitioned‎. ‎we show that the‎ ‎total domatic number of a random $r$-regular graph is almost‎...

H. R. Maimani , M. Sabzevari ,

The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we give formula for Merrifield-Simmons and Hosoya indices of some classes of cartesian product of two graphs K{_2}×H, where H is a path graph P{_n}, cyclic graph C{_n}, or star gra...

Journal: :Open journal of Discrete Mathematics 2023

Cycle multiplicity of a graph G is the maximum number edge disjoint cycles in G. In this paper, we determine cycle and then obtain formula total complete bipartite graph, generalizes result for, which given by M.M. Akbar Ali [1].

Journal: :transactions on combinatorics 2011
adel p. kazemi

let $k$ be a positive integer. a subset $s$ of $v(g)$ in a graph $g$ is a $k$-tuple total dominating set of $g$ if every vertex of $g$ has at least $k$ neighbors in $s$. the $k$-tuple total domination number $gamma _{times k,t}(g)$ of $g$ is the minimum cardinality of a $k$-tuple total dominating set of $g$. if$v(g)=v^{0}={v_{1}^{0},v_{2}^{0},ldots ,v_{n}^{0}}$ and $e(g)=e_{0}$, then for any in...

Let $G$ be a $(p,q)$ graph. Let $f:V(G)to{1,2, ldots, k}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if $left|t_{f}(i)-t_{f}(j)right|leq 1$, $i,j in {1,2, cdots,k}$ where $t_{f}(x)$ denotes the total number of vertices and the edges labelled with $x$. A graph with a $k$-total prime cordi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید