نتایج جستجو برای: vertex friendly

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

2004
Haisheng Li

This paper studies certain relations among vertex algebras, vertex Lie algebras and vertex poisson algebras. In this paper, the notions of vertex Lie algebra (conformal algebra) and vertex poisson algebra are revisited and certain general construction theorems of vertex poisson algebras are given. A notion of filtered vertex algebra is formulated in terms of a notion of good filtration and it i...

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and let $d_u$ denote the degree of vertex $u$ in $G$. The Randi'c index of $G$ is defined as${R}(G) =sum_{uvin E(G)} 1/sqrt{d_ud_v}.$In this paper, we investigate the relationships between Randi'cindex and several topological indices.

Journal: :iranian journal of science and technology (sciences) 2013
g. r. rezaeezadeh

in this paper, it was shown that , where  and , and , where  is not prime and , are od-characterizable.

Journal: :iranian journal of mathematical chemistry 2010
f. hassani o. khormali a. iranmanesh

in this paper, at first we introduce a new index with the name co-pi index and obtain someproperties related this new index. then we compute this new index for tuc4c8(r) nanotubes.

Journal: :bulletin of the iranian mathematical society 0
a. ali department of mathematics, national university of computer and emerging sciences, b-block, faisal town, lahore, pakistan. a. bhatti department of mathematics, national university of computer and emerging sciences, b-block, faisal town, lahore, pakistan. z. raza department of mathematics, national university of computer and emerging sciences, b-block, faisal town, lahore, pakistan.and department of mathematics, college of sciences, university of sharjah, sharjah, united arab emirates.

let $gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. denote by $upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. in the classes of graphs $gamma_{n,kappa}$ and $upsilon_{n,beta}$, the elements having maximum augmented zagreb index are determined.

Journal: :Lecture Notes in Computer Science 2021

For intractable problems on graphs of bounded treewidth, two graph parameters treedepth and vertex cover number have been used to obtain fine-grained complexity results. Although the studies in this direction are successful, we still need a systematic way for further investigations because form rather small subclass treedepth. To fill gap, use integrity, which is placed between mentioned above....

Journal: :Journal of Algebra 2021

We first investigate the algebraic structure of vertex algebroids B when are simple Leibniz algebras. Next, we use these to construct indecomposable non-simple C2-cofinite N-graded algebras VB?. In addition, classify irreducible VB?-modules and examine conformal vectors

2017

(/Protocols/Cancer/Chemotherapy/Page-08) Table 2: Integrative Therapies to Lessen Chemotherapy Side Effects (/Protocols/Cancer/Chemotherapy/Page-08#table2) Fatigue (/Protocols/Cancer/Chemotherapy/Page-08#fatigue) Immunosuppression and Blood-Related Complications (/Protocols/Cancer/Chemotherapy/Page-08#blood) Nausea and Vomiting (/Protocols/Cancer/Chemotherapy/Page-08#nausea) Peripheral Neuropat...

2011
A. Meyrier Alexander Woywodt Helen Alderson Liz Lamerton Zoe Thain Grahame Wood

Pneumocystis jirovecii pneumonia (PJP) is a rare but feared complication in immunocompromised patients. Most experience with PJP stems from patients with the human immunodeficiency infection (HIV) although nephrologists see the occasional case, usually in renal transplant patients during the first post-transplant year. The diagnosis requires a high degree of suspicion and treatment is with high...

It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...

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

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