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

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

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 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 2011
f. mohammadi d. kiani

Journal: :algebraic structures and their applications 2015
a. mahmoodi

let $r$ be a ring with unity. the undirected nilpotent graph of $r$, denoted by $gamma_n(r)$, is a graph with vertex set ~$z_n(r)^* = {0neq x in r | xy in n(r) for some y in r^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in n(r)$, or equivalently, $yx in n(r)$, where $n(r)$ denoted the nilpotent elements of $r$. recently, it has been proved that if $r$ is a left ar...

Journal: :international journal of group theory 2012
n. ahanjideh a. iranmanesh

given a non-abelian finite group $g$, let $pi(g)$ denote the set of prime divisors of the order of $g$ and denote by $z(g)$ the center of $g$. thetextit{ prime graph} of $g$ is the graph with vertex set $pi(g)$ where two distinct primes $p$ and $q$ are joined by an edge if and only if $g$ contains an element of order $pq$ and the textit{non-commuting graph} of $g$ is the graph with the vertex s...

Journal: :journal of algebraic systems 2015
neda ahanjideh hajar mousavi

let $g$ be a non-abelian finite group. in this paper, we prove that $gamma(g)$ is $k_4$-free if and only if $g cong a times p$, where $a$ is an abelian group, $p$ is a $2$-group and $g/z(g) cong mathbb{ z}_2 times mathbb{z}_2$. also, we show that $gamma(g)$ is $k_{1,3}$-free if and only if $g cong {mathbb{s}}_3,~d_8$ or $q_8$.

Journal: :transactions on combinatorics 2012
anwar saleh alwardi n. d. soner

we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.

In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and  the icosahedral graph.

Journal: :transactions on combinatorics 2014
veena mathad kishori p. narayankar

a signed graph (marked graph) is an ordered pair $s=(g,sigma)$$(s=(g,mu))$, where $g=(v,e)$ is a graph called the underlyinggraph of $s$ and $sigma:erightarrow{+,-}$$(mu:vrightarrow{+,-})$ is a function. for a graph $g$, $v(g),e(g)$ and $c(g)$ denote its vertex set, edge set and cut-vertexset, respectively. the lict graph $l_{c}(g)$ of a graph $g=(v,e)$is defined as the graph having vertex set ...

Journal: :algebraic structures and their applications 2014
sh. payrovi h. pasebani

let $g$ be a group. the order graph of $g$ is the (undirected)graph $gamma(g)$,those whose vertices are non-trivial subgroups of $g$ and two distinctvertices $h$ and $k$ are adjacent if and only if either$o(h)|o(k)$ or $o(k)|o(h)$. in this paper, we investigate theinterplay between the group-theoretic properties of $g$ and thegraph-theoretic properties of $gamma(g)$. for a finite group$g$, we s...

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

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