نتایج جستجو برای: Graph

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

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

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

Journal: :journal of algebra and related topics 2015
a. sharma a. gaur

let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...

Journal: :transactions on combinatorics 2014
mostafa tavakoli f. rahbarnia m. mirzavaziri a. r. ashrafi

‎let $d_{n,m}=big[frac{2n+1-sqrt{17+8(m-n)}}{2}big]$ and‎ ‎$e_{n,m}$ be the graph obtained from a path‎ ‎$p_{d_{n,m}+1}=v_0v_1 cdots v_{d_{n,m}}$ by joining each vertex of‎ ‎$k_{n-d_{n,m}-1}$ to $v_{d_{n,m}}$ and $v_{d_{n,m}-1}$‎, ‎and by‎ ‎joining $m-n+1-{n-d_{n,m}choose 2}$ vertices of $k_{n-d_{n,m}-1}$‎ ‎to $v_{d_{n,m}-2}$‎. ‎zhang‎, ‎liu and zhou [on the maximal eccentric‎ ‎connectivity ind...

Journal: :algebraic structures and their applications 0
hamid reza dorbidi university of jiroft

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.

Journal: :journal of algorithms and computation 0
kristiana wijaya combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia lyra yulianti department of mathematics, faculty of mathematics and natural sciences, andalas university, kampus unand limau manis padang 25136 indonesia edy tri baskoro combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia hilda assiyatun combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia djoko suprijanto combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia

let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...

Journal: :iranian journal of mathematical chemistry 2013
m. tavakoli f. rahbarnia

in this paper, we first collect the earlier results about some graph operations and then wepresent applications of these results in working with chemical graphs.

Journal: :bulletin of the iranian mathematical society 0
r. kafshgarzaferani

0

Journal: :journal of linear and topological algebra (jlta) 2015
m ahrari sh. a. safari sabet b amini

the annihilating-ideal graph of a commutative ring $r$ is denoted by $ag(r)$, whose vertices are all nonzero ideals of $r$ with nonzero annihilators and two distinct vertices $i$ and $j$ are adjacent if and only if $ij=0$. in this article, we completely characterize rings $r$ when $gr(ag(r))neq 3$.

Journal: :iranian journal of mathematical chemistry 0
b basavanagoud karnatak university dharwad s. patil karnatak university v r desai karnatak university m tavakoli ferdowsi university of mashhad a r ashrafi university of kashan

a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

Journal: :iranian journal of mathematical chemistry 2012
m. ghorbani a. zaeembashi m. shahrezaei a. tabatabaei adnani

it is necessary to generate the automorphism group of a chemical graph in computer-aidedstructure elucidation. an euclidean graph associated with a molecule is defined by a weightedgraph with adjacency matrix m = [dij], where for i≠j, dij is the euclidean distance between thenuclei i and j. in this matrix dii can be taken as zero if all the nuclei are equivalent. otherwise,one may introduce dif...

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

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