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

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

Journal: :The Journal of Chemical Physics 2016

Journal: :Journal of Combinatorial Theory, Series B 2015

Journal: :iranian journal of mathematical chemistry 2016
f. shafiei m. pashm froush f. dialamehpour

qspr study on benzene derivatives have been made using recently introduced topological methodology. in this study the relationship between the randic' (x'), balaban (j), szeged (sz),harary (h), wiener (w), hyperwiener and wiener polarity (wp) to the thermal energy (eth), heat capacity (cv) and entropy (s) of benzene derivatives is represented.physicochemical properties are taken from the quantu...

Let $G$ be a non-abelian group and let $Z(G)$ be the center of $G$. Associate with $G$ there is agraph $Gamma_G$ as follows: Take $Gsetminus Z(G)$ as vertices of$Gamma_G$ and joint two distinct vertices $x$ and $y$ whenever$yxneq yx$. $Gamma_G$ is called the non-commuting graph of $G$. In recent years many interesting works have been done in non-commutative graph of groups. Computing the clique...

Journal: :bulletin of the iranian mathematical society 0
b. omoomi department of mathematical sciences‎, ‎isfahan university of technology‎, ‎84156-83111‎, ‎isfahan‎, ‎iran. z. maleki department of mathematical sciences, isfahan university of technology, 84156-83111, isfahan, iran

‎for a set of non-negative integers~$l$‎, ‎the $l$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $a_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|a_u cap a_v|in l$‎. ‎the bipartite $l$-intersection number is defined similarly when the conditions are considered only for the ver...

Journal: :journal of algorithms and computation 0
stephen j. gismondi department of mathematics & statistics, university of guelph, guelph, on, ca. n1g 2w1

a compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. directed hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. sets of extrema of birkhoff polyhedra are mapped to tours ...

Journal: :iranian journal of mathematical chemistry 2012
a. loghman

the unitary cayley graph xn has vertex set zn = {0, 1,…, n-1} and vertices u and v areadjacent, if gcd(uv, n) = 1. in [a. ilić, the energy of unitary cayley graphs, linear algebraappl. 431 (2009) 1881–1889], the energy of unitary cayley graphs is computed. in this paperthe wiener and hyperwiener index of xn is computed.

Journal: :Linear Algebra and its Applications 1994

Journal: :European Journal of Combinatorics 2005

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

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