نتایج جستجو برای: energy of graph

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

Journal: :transactions on combinatorics 2015
shariefuddin pirzada hilal a. ganie

for a simple connected graph $g$ with $n$-vertices having laplacian eigenvalues‎ ‎$mu_1$‎, ‎$mu_2$‎, ‎$dots$‎, ‎$mu_{n-1}$‎, ‎$mu_n=0$‎, ‎and signless laplacian eigenvalues $q_1‎, ‎q_2,dots‎, ‎q_n$‎, ‎the laplacian-energy-like invariant($lel$) and the incidence energy ($ie$) of a graph $g$ are respectively defined as $lel(g)=sum_{i=1}^{n-1}sqrt{mu_i}$ and $ie(g)=sum_{i=1}^{n}sqrt{q_i}$‎. ‎in th...

Journal: :iranian journal of mathematical chemistry 2015
i. gutman

the energy of a graph is equal to the sum of the absolute values of its eigenvalues. two graphs of the same order are said to be equienergetic if their energies are equal. we point out the following two open problems for equienergetic graphs. (1) although it is known that there are numerous pairs of equienergetic, non-cospectral trees, it is not known how to systematically construct any such pa...

Journal: :bulletin of the iranian mathematical society 0
r. k. zaferani

0

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

a one dimensional dynamic model for a riser reactor in a fluidized bed catalytic cracking unit (fccu) for gasoil feed has been developed in two distinct conditions, one for industrial fccu and another for fccu using various frequencies of microwave energy spaced at the height of the riser reactor (fccu-mw). in addition, in order to increase the accuracy of component and bulk diffusion, instanta...

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

in this thesis, structural, electronical, and optical properties of inverse pervskite(ca3pbo) in cubic phase have been investigated.the calculation have been done based on density functional theory and according to generalized gradiant approximate (gga) as correlating potential. in order to calculate the configurations, implementing in the wien2k code have been used from 2013 version. first of ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علامه طباطبایی 1391

this research is about the political economy of china in central asia. in this research the political & economic interactions affected on chinas political economy in central asia are examined. chinas goal of presence in central asia including political-security, economic and energy goals is described in one part. in another part, the trade relations between china and central asian countries ar...

Journal: :transactions on combinatorics 2016
harishchandra s. ramane k. channegowda nandeesh ivan gutman xueliang li

let $d$ be a digraph with skew-adjacency matrix $s(d)$‎. ‎the skew‎ ‎energy of $d$ is defined as the sum of the norms of all‎ ‎eigenvalues of $s(d)$‎. ‎two digraphs are said to be skew‎ ‎equienergetic if their skew energies are equal‎. ‎we establish an‎ ‎expression for the characteristic polynomial of the skew‎ ‎adjacency matrix of the join of two digraphs‎, ‎and for the‎ ‎respective skew energ...

Journal: :communication in combinatorics and optimization 0
ch. adiga university of mysore rakshith b r university of mysore

two digraphs of same order are said to be skew-equienergetic if theirskew energies are equal. one of the open problems proposed by li andlian was to construct non-cospectral skew-equienergetic digraphs onn vertices. recently this problem was solved by ramane et al. inthis paper, we give some new methods to construct new skew-equienergeticdigraphs.

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

در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...

Journal: :transactions on combinatorics 2013
pradeep g. bhat sabitha d'souza

‎let $g$ be a graph with vertex set $v(g)$ and edge set $x(g)$ and consider the set $a={0,1}$‎. ‎a mapping $l:v(g)longrightarrow a$ is called binary vertex labeling of $g$ and $l(v)$ is called the label of the vertex $v$ under $l$‎. ‎in this paper we introduce a new kind of graph energy for the binary labeled graph‎, ‎the labeled graph energy $e_{l}(g)$‎. ‎it depends on the underlying graph $g$...

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

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