نتایج جستجو برای: ladder and complete graph
تعداد نتایج: 16878550 فیلتر نتایج به سال:
Inspired by the chemical applications of higher-order connectivity index (or Randic index), we consider here the higher-order first Zagreb index of a molecular graph. In this paper, we study the linear regression analysis of the second order first Zagreb index with the entropy and acentric factor of an octane isomers. The linear model, based on the second order first Zag...
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...
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...
Abstrak. Automorfisma dari suatu graf G merupakan isomorfisma ke dirinya sendiri, yaitu fungsi yang memetakan sendiri. dapat dicari dengan menentukan semua kemungkinan satu-satu, onto serta himpunan titik pada tersebut. Artikel ini difokuskan penentuan banyaknya tangga dan lingkaran automorfisma grup dibentuk oleh kedua Jenis penelitian dasar atau murni metode digunakan adalah studi literatur. ...
A vertex-coloured graph G is said to be rainbow vertex-connected, if every two vertices of are connected by a path whose internal have distinct colours. The vertex-connection number G, denoted rvc(G), the smallest colours that needed make vertex-connected. This study focuses on deriving formulas for vertex connectivity simple ladder and roach graph.
let $r$ be a commutative ring with identity and $mathbb{a}(r)$ be the set of ideals of $r$ with non-zero annihilators. in this paper, we first introduce and investigate the principal ideal subgraph of the annihilating-ideal graph of $r$, denoted by $mathbb{ag}_p(r)$. it is a (undirected) graph with vertices $mathbb{a}_p(r)=mathbb{a}(r)cap mathbb{p}(r)setminus {(0)}$, where $mathbb{p}(r)$ is...
the concept of the bipartite divisor graph for integer subsets has been considered in [m. a. iranmanesh and c. e. praeger, bipartite divisor graphs for integer subsets, {em graphs combin.}, {bf 26} (2010) 95--105.]. in this paper, we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph. we show that if $g...
utopia has, for four centuries, accompanied that hope of progress and that striving for betterment. it now straggles against a widespread sense that this has been an illusion, or an impossible dream. the utopian idea can never entirely disappear, but utopia as a form of the social imagination has clearly weakened. if it cannot instill its vision in the public consciousness, the consequences...
let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...
over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید