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

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

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.

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

هدف تحقیق حاضر بررسی تاثیر نشانه های فرا گفتمان متنی بر فهم متون انگلیسی به وسیله ی زبان اموزان فارسی زبان است.این تحقیق علاوه بر این کوشیده است تا میزان اگاهی این زبان اموزان و نحوه ی تعامل انان را با متون خوانده شده در زبان انگلیسی به وسیله ی پرسش نامه ی تهیه شده بررسی کند.بر اساس محتوای یک متن انگلیسی یازده سوال درست /غلط طرح گردید و یک مرتبه با ان متن و یک مرتبه با نسخه ای که نشانه ها...

Journal: :Optimization Methods and Software 2013

Journal: :Discrete Applied Mathematics 2003
Fedor V. Fomin Petr A. Golovach

The interval degree id(G) of a graph G is de/ned to be the smallest max-degree of any interval supergraphs of G. One of the reasons for our interest in this parameter is that the bandwidth of a graph is always between id(G)=2 and id(G). We prove also that for any graph G the interval degree of G is at least the pathwidth of G. We show that if G is an AT-free claw-free graph, then the interval d...

D. Meskó,

During the planning phase of modern, complex, block-structured, large-area located, but still landscape-harmonized health-care buildings, the key is the optimal positioning of the blocks and functions, simultaneously ensuring the most-effective backup-paths for any transportation route failure in the buildings in order to speed up system operation, reduce maintenance costs and especially to imp...

Journal: :communication in combinatorics and optimization 0
abbas alilou azarbaijan shahid madani university jafar amjadi azarbaijan shahid madani university

let $r$ be a commutative ring with identity. an ideal $i$ of a ring $r$is called an annihilating ideal if there exists $rin rsetminus {0}$ such that $ir=(0)$ and an ideal $i$ of$r$ is called an essential ideal if $i$ has non-zero intersectionwith every other non-zero ideal of $r$. thesum-annihilating essential ideal graph of $r$, denoted by $mathcal{ae}_r$, isa graph whose vertex set is the set...

Journal: :iranian journal of science and technology (sciences) 2013
g. r. rezaeezadeh

in this paper, it was shown that , where  and , and , where  is not prime and , are od-characterizable.

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...

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

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