نتایج جستجو برای: f and g indices

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

In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $left| e_{...

‎Let $R$ be a noncommutative prime ring of‎ ‎characteristic different from $2$‎, ‎$U$ the Utumi quotient ring of $R$‎, ‎$C$ $(=Z(U))$ the extended centroid‎ ‎of $R$‎. ‎Let $0neq ain R$ and $f(x_1,ldots,x_n)$ a multilinear‎ ‎polynomial over $C$ which is noncentral valued on $R$‎. ‎Suppose‎ ‎that $G$ and $H$ are two nonzero generalized derivations of $R$‎ ‎such that $a(H(f(x))f(x)-f(x)G(f(x)))in ...

Let f, g and h be all entire functions of several complex variables. In this paper we would like to establish some inequalities on the basis of relative order and relative lower order of f with respect to g when the relative orders and relative lower orders of both f and g with respect to h are given.

Functionalized Multi-walled carbon nanotubes (f-MWCNTs) which are modified using nitric acid and sulfuric acid were evaluated to synthesize a uniform nanocomposite via application of TiO2. The f-MWCNTs-TiO2 nanocomposites have been produced via using the chemical simple two-step method. To characterize the structural analysis, scanning electron microscopy...

Suppose G is an nvertex and medge simple graph with edge set E(G). An integervalued function f: E(G) → Z is called a flow. Tutte was introduced the flow polynomial F(G, λ) as a polynomial in an indeterminate λ with integer coefficients by F(G,λ) In this paper the Flow polynomial of some dendrimers are computed.

Journal: :journal of algorithms and computation 0
p. jeyanthi principal and head of the research centre,department of mathematics,govindammal aditanar college for women,tiruchendur,tamilnadu,india d. ramya department of mathematics, dr.sivanthi aditanar college of engineering, tiruchendur- 628 215, india. r. kalaiyarasi department of mathematics, dr.sivanthi aditanar college of engineering, tiruchendur- 628 215, india.

in this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. let g = (v,e) be a graph with p vertices and q edges. g is said be skolem odd difference mean if there exists a function f : v (g) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : e(g) → {1, 3, 5, . . . , 2q−1} d...

Journal: :international journal of group theory 0
jiangtao shi yantai university

let $g={rm sl}_2(p^f)$ be a special linear group and $p$ be a sylow‎ ‎$2$-subgroup of $g$‎, ‎where $p$ is a prime and $f$ is a positive‎ ‎integer such that $p^f>3$‎. ‎by $n_g(p)$ we denote the normalizer of‎ ‎$p$ in $g$‎. ‎in this paper‎, ‎we show that $n_g(p)$ is nilpotent (or‎ ‎$2$-nilpotent‎, ‎or supersolvable) if and only if $p^{2f}equiv‎ ‎1,({rm mod},16)$‎.

2017
David Wajc

In these notes we present the notion of Negative Association, discuss some of its useful properties, and end with some example applications. The slogan to bear in mind here is “independent, or better”. 1 Negative Association Definition In randomized algorithms, our randomness often takes on the form of independent random variables, allowing us to apply powerful theorems concerning such variable...

Journal: :iranian journal of mathematical chemistry 2011
z. yarahmadi

a topological index of a molecular graph g is a numeric quantity related to g which isinvariant under symmetry properties of g. in this paper we obtain the randić, geometricarithmetic,first and second zagreb indices , first and second zagreb coindices of tensorproduct of two graphs and then the harary, schultz and modified schultz indices of tensorproduct of a graph g with complete graph of ord...

2015
Yun Gao Tianwei Xu Li Liang Wei Gao

function f: G  , with this property that f(G1) = f(G2) if G1 and G2 are isomorphic. There are several vertex distance-based and degree-based indices which introduced to analyze the chemical properties of molecule graph. For instance: Wiener index, PI index, Szeged index, geometric-arithmetic index, atom-bond connectivity index and general sum connectivity index are introduced to test the perf...

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

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