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

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

Journal: :iranian journal of mathematical chemistry 2014
f fayazi s rahimi sharbaf

a concept related to the spectrum of a graph is that of energy. the energy e(g) of a graph g is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of g . the laplacian energy of a graph g is equal to the sum of distances of the laplacian eigenvalues of g and the average degree d(g) of g. in this paper we introduce the concept of laplacian energy of fuzzy graphs. ...

Journal: :algebraic structures and their applications 0
reza taheri islamic azad university, science and research branch, tehran, iran abolfazl tehranian islamic azad university, science and research branch, tehran, iran

let $r$ be a commutative ring with identity and $mathbb{a}(r)$ be the set   of ideals of $r$ with non-zero annihilators. in this paper, we first introduce and investigate the principal ideal subgraph of the annihilating-ideal graph of $r$, denoted by $mathbb{ag}_p(r)$. it is a (undirected) graph with vertices $mathbb{a}_p(r)=mathbb{a}(r)cap mathbb{p}(r)setminus {(0)}$, where   $mathbb{p}(r)$ is...

Let G be a group. Recall that the intersection graph of subgroups of G is an undirected graph whose vertex set is the set of all nontrivial subgroups of G and distinct vertices H,K are joined by an edge in this graph if and only if the intersection of H and K is nontrivial. The aim of this article is to investigate the interplay between the group-theoretic properties of a finite group G and the...

Cheraghi Cheraghi, Massoud Hadian Dehkordi,

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...

2008
Dietmar Berwanger Laurent Doyen

We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect information typically increase the game size exponentially. Our construction avoids such a blow-up by using imperfect information to realise succinct counters which cover a range exponentially larger than their size. In particu...

2008
Panthila Rujirojindakul

Objective : To evaluate the effects of a single dose of intravenous dexamethasone on postoperative pain and complications after adult tonsillectomy. Methods : Fifty patients scheduled for elective tonsillectomy were recruited to this randomized, double-blind, placebo-controlled study. Dexamethasone 20 mg intravenously was given after intubation in one group whereas the placebo group, saline sol...

Journal: :Applied and environmental microbiology 1989
T J Volk T J Leonard

This study provides a set of nutritional and environmental parameters suitable for the growth of morel (Morchella crassipes) sclerotia in the laboratory, using a modification of the jar method of Ower et al. (U.S. patent 4,594,809, June 1986). The optimum nutritional and environmental conditions for morel sclerotium formation and maturation as determined in this study consist of a layer of rye ...

Journal: :bulletin of the iranian mathematical society 2014
asghar madadi rashid zaare-nahandi

‎in this paper‎, ‎we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is cohen-macaulay‎. ‎it is proved that if there exists a cover of an $r$-partite cohen-macaulay graph by disjoint cliques of size $r$‎, ‎then such a cover is unique‎.

Journal: :iranian journal of science and technology (sciences) 2014
j. baskar babujee

the crossing number of a graph  is the minimum number of edge crossings over all possible drawings of  in a plane. the crossing number is an important measure of the non-planarity of a graph, with applications in discrete and computational geometry and vlsi circuit design. in this paper we introduce vertex centered crossing number and study the same for maximal planar graph.

Journal: :transactions on combinatorics 2015
denglan cui yaoping hou

the $k$-th semi total point graph $r^k(g)$ of a graph $g$, is a graph obtained from $g$ by adding $k$ vertices corresponding to each edge and connecting them to endpoint of edge considered. in this paper, we obtain formulae for the resistance distance and kirchhoff index of $r^k(g)$.

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

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