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

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

Journal: :journal of algorithms and computation 0
p. jeyanthi research centre, department of mathematics, govindammal aditanar college for women tiruchendur, tamil nadu, india. t. saratha devi department of mathematics, g. venkataswamy naidu college, kovilpatti, tamil nadu, india.

an injective map f : e(g) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph g(p, q) if the induced vertex function f*: v (g) → z − {0} defined by f*(v) = (sigma e∈ev) f (e) is one-one, where ev denotes the set of edges in g that are incident with a vetex v and f*(v (g)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} u {k(p+1)/2} accordin...

Journal: :transactions on combinatorics 2012
p. balakrishnan r. kala

‎in this paper we introduce the concept of order difference interval graph $gamma_{odi}(g)$ of a group $g$‎. ‎it is a graph $gamma_{odi}(g)$ with $v(gamma_{odi}(g)) = g$ and two vertices $a$ and $b$ are adjacent in $gamma_{odi}(g)$ if and only if $o(b)-o(a) in [o(a)‎, ‎o(b)]$‎. ‎without loss of generality‎, ‎we assume that $o(a) leq o(b)$‎. ‎in this paper we obtain several properties of $gamma_...

Journal: :journal of sciences, islamic republic of iran 2014
b. tolue a. erfanian a. jafarzadeh

let g be a fixed element of a finite group g. we introduce the g-noncommuting graph of g whose vertex set is whole elements of the group g and two vertices x,y are adjacent whenever [x,y] g  and  [y,x] g. we denote this graph by . in this paper, we present some graph theoretical properties of g-noncommuting graph. specially, we investigate about its planarity and regularity, its clique number a...

 The order graph of a group $G$, denoted by $Gamma^*(G)$, is a graph whose vertices are subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $|H|big{|}|K|$ or $|K|big{|}|H|$. In this paper, we study the connectivity and diameter of this  graph. Also we give a relation between the order graph and prime  graph of a group.

Let graph energy is a graph--spectrum--based quantity‎, ‎introduced in the 1970s‎. ‎After a latent period of 20--30 years‎, ‎it became a popular topic of research both‎ ‎in mathematical chemistry and in ``pure'' spectral graph theory‎, ‎resulting in‎ ‎over 600 published papers‎. ‎Eventually‎, ‎scores of different graph energies have‎ ‎been conceived‎. ‎In this article we...

Journal: :journal of algorithms and computation 0
hamid doost hosseini university of tehran, college of engineering, school of civil engineering

the tenacity of a graph g, t(g), is de ned by t(g) = min{[|s|+τ(g-s)]/[ω(g-s)]}, where the minimum is taken over all vertex cutsets s of g. we de ne τ(g - s) to be the number of the vertices in the largest component of the graph g - s, and ω(g - s) be the number of components of g - s.in this paper a lower bound for the tenacity t(g) of a graph with genus γ(g) is obtained using the graph's...

2016
Bill Alves Harvey Mudd BILL ALVES

Filmmakers. In Bruce Posner (ed.) UnseenCinema: Early American Avant-Garde Film 1893–1941.New York: Anthology Film Archives. Stravinsky, Igor. 1970. Poetics of Music in the Form ofSix Lessons, trans. Arthur Knodel and Ingolf Dahl.Cambridge, MA: Harvard University Press.Sutton, Daud. 2007. Islamic Design: A Genius for Geometry. New York: Walker.Tenney, James. 1988. A Hist...

Journal: :algebraic structures and their applications 2014
saeid alikhani saeed mirvakili

let $g=(v,e)$ be a simple graph. a set $ssubseteq v$ isindependent set of $g$,  if no two vertices of $s$ are adjacent.the  independence number $alpha(g)$ is the size of a maximumindependent set in the graph. in this paper we study and characterize the independent sets ofthe zero-divisor graph $gamma(r)$ and ideal-based zero-divisor graph $gamma_i(r)$of a commutative ring $r$.

For a graph $G$ let $gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a single vertex from $G$ has at least one EDS, and (ii) a hypo-unique domination graph (a hypo-$mathcal{UD}$ graph) if $G$ has at least two minimum dominating sets...

In this paper, the composite order Cayley graph Cay(G, S) is introduced, where G is a group and S is the set of all composite order elements of G. Some graph parameters such as diameter, girth, clique number, independence number, vertex chromatic number and domination number are calculated for the composite order Cayley graph of some certain groups. Moreover, the planarity of composite order Ca...

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

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