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

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

Journal: :Proyecciones (Antofagasta) 2012

Journal: :iranian journal of mathematical chemistry 2012
a. mahmiani o. khormali a. iranmanesh

the edge versions of reverse wiener indices were introduced by mahmiani et al. veryrecently. in this paper, we find their relation with ordinary (vertex) wiener index in somegraphs. also, we compute them for trees and tuc4c8(s) naotubes.

The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...

Let $R$ be a commutative ring with identity. An ideal $I$ of a ring $R$is called an annihilating ideal if there exists $rin Rsetminus {0}$ such that $Ir=(0)$ and an ideal $I$ of$R$ is called an essential ideal if $I$ has non-zero intersectionwith every other non-zero ideal of $R$. Thesum-annihilating essential ideal graph of $R$, denoted by $mathcal{AE}_R$, isa graph whose vertex set is the set...

A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...

A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...

Journal: :international journal of industrial mathematics 2015
s. z. aghamohammadi‎

‎the narumi-katayama index was the first topological index defined‎ ‎by the product of some graph theoretical quantities‎. ‎let $g$ be a ‎simple graph with vertex set $v = {v_1,ldots‎, ‎v_n }$ and $d(v)$ be‎ ‎the degree of vertex $v$ in the graph $g$‎. ‎the narumi-katayama ‎index is defined as $nk(g) = prod_{vin v}d(v)$‎. ‎in this paper,‎ ‎the narumi-katayama index is generalized using a $n$-ve...

K Ghazikhanlou Sani MR Jafari S Shams

Sena-Graph syrup has recently been formulated by an Iranian pharmaceutical company for being used in bowel evacuation before radiography, colonoscopy and surgery. This study compares the efficacy, adverse effects and patient compliance of two bowel preparation regimens with castor oil and Sena-Graph syrup in of outpatients for Intravenous Urography (IVU). One hundred and fourteen consecutive ou...

Journal: :The Electronic Journal of Combinatorics 2010

Journal: :Indian Journal of Science and Technology 2011

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

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