نتایج جستجو برای: product of graphs

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

M. Nouri Jouybari S. Firouzian Y. Talebi

Let R be a commutative ring with identity and M an R-module. The Scalar-Product Graph of M is defined as the graph GR(M) with the vertex set M and two distinct vertices x and y are adjacent if and only if there exist r or s belong to R such that x = ry or y = sx. In this paper , we discuss connectivity and planarity of these graphs and computing diameter and girth of GR(M). Also we show some of...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه لرستان - دانشکده علوم پایه 1392

‎in this article‎, ‎we have focused one some basic and productive information about the properties of spectrum and singular values related to compact operators which are ideals in a c*-algebra of bounded operators‎. ‎considering a two-sided connection between the family of symmetric gauge functions on sequence of singular values of compact operators and symmetric norms on finite dimensional ope...

Journal: :transactions on combinatorics 2015
v. sheeba agnes

in this paper, the degree distance and the gutman index of the corona product of two graphs are determined. using the results obtained, the exact degree distance and gutman index of certain classes of graphs are computed.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده علوم 1375

this thesis basically deals with the well-known notion of the bear-invariant of groups, which is the generalization of the schur multiplier of groups. in chapter two, section 2.1, we present an explicit formula for the bear-invariant of a direct product of cyclic groups with respect to nc, c>1. also in section 2.2, we caculate the baer-invatiant of a nilpotent product of cyclic groups wuth resp...

Journal: :transactions on combinatorics 2014
m. tavakoli f. rahbarnia ali reza ashrafi

the corona product $gcirc h$ of two graphs $g$ and $h$ isobtained by taking one copy of $g$ and $|v(g)|$ copies of $h$;and by joining each vertex of the $i$-th copy of $h$ to the$i$-th vertex of $g$, where $1 leq i leq |v(g)|$. in thispaper, exact formulas for the eccentric distance sum and the edgerevised szeged indices of the corona product of graphs arepresented. we also study the conditions...

پایان نامه :دانشگاه تربیت معلم - تهران - دانشکده ادبیات و علوم انسانی 1393

abstract target-oriented approaches to translation studies are regarded as recent theories of translation. one of the most famous theories among these approaches is descriptive translation studies presented by toury (1995). this theory gives a new dimension to translation studies and gives importance to the descriptive rather than prescriptive studies. it also identifies three sets of transla...

‎    The Narumi-Katayama index is the first topological index defined by the product of some graph theoretical quantities. Let G be a simple graph. Narumi-Katayama index of G is defined as the product of the degrees of the vertices of G. In this paper, we define the Narumi-Katayama polynomial of G. Next, we investigate some properties of this polynomial for graphs and then, we obtain ...

پایان نامه :دانشگاه تربیت معلم - سبزوار - دانشکده ریاضی و کامپیوتر 1390

همچنین با استفاده از نتیجه های به دست آمده الگوریتم هایی برای امتحان یکتایی رنگ پذیری ارائه داده شد. به عنوان یک کاربرد، مثال نقضی را برای حدس ژو، مربوط به ‎3-‎رنگ پذیری یکتای گراف های بدون مثلث بررسی می کنیم ‎ایده ی اصلی این پایان نامه از مقاله ‎‎c‎. ‎hillar‎, ‎t‎. ‎windfeldt‎, ‎it algebraic characterization of uniquely vertex colorable graphs, ‎j‎. ‎combin‎. ‎theory ser‎. ‎b 98 (2008) 400...

A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...

The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.

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

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