نتایج جستجو برای: simple graph
تعداد نتایج: 634615 فیلتر نتایج به سال:
the rings considered in this article are commutative with identity which admit at least two nonzero annihilating ideals. let $r$ be a ring. let $mathbb{a}(r)$ denote the set of all annihilating ideals of $r$ and let $mathbb{a}(r)^{*} = mathbb{a}(r)backslash {(0)}$. the annihilating-ideal graph of $r$, denoted by $mathbb{ag}(r)$ is an undirected simple graph whose vertex set is $mathbb{a}(r)...
the second multiplicative zagreb coindex of a simple graph $g$ is defined as: $${overline{pi{}}}_2left(gright)=prod_{uvnotin{}e(g)}d_gleft(uright)d_gleft(vright),$$ where $d_gleft(uright)$ denotes the degree of the vertex $u$ of $g$. in this paper, we compare $overline{{pi}}_2$-index with some well-known graph invariants such as the wiener index, schultz index, eccentric co...
let $g$ be a simple graph with an orientation $sigma$, which assigns to each edge a direction so that $g^sigma$ becomes a directed graph. $g$ is said to be the underlying graph of the directed graph $g^sigma$. in this paper, we define a weighted skew adjacency matrix with rand'c weight, the skew randi'c matrix ${bf r_s}(g^sigma)$, of $g^sigma$ as the real skew symmetric mat...
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
Stanton graphs Sk (in honor of professor Ralph G. Stanton) are defined, and a new graph decomposition problem for Stanton graphs is proposed. Such decompositions of λKv for all v’s with minimum λ’s have been obtained for S3.
In this paper an algorithm for computing the Balaban and Randic indices of any simple connected graph was introduced. Also these indices were computed for IPR C80 fullerene isomers, Zigzag nanotubes and graphene by GAP program.
Let G be a finite group and let $GK(G)$ be the prime graph of G. We assume that $n$ is an odd number. In this paper, we show that if $GK(G)=GK(B_n(p))$, where $ngeq 9$ and $pin {3,5,7}$, then G has a unique nonabelian composition factor isomorphic to $B_n(p)$ or $C_n(p)$ . As consequences of our result, $B_n(p)$ is quasirecognizable by its spectrum and also by a new proof, the ...
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
let $g$ be a simple graph. an independent set is a set ofpairwise non-adjacent vertices. the number of vertices in a maximum independent set of $g$ isdenoted by $alpha(g)$. in this paper, we characterize graphs $g$ with $n$ vertices and with maximumnumber of maximum independent sets provided that $alpha(g)leq 2$ or $alpha(g)geq n-3$.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید