نتایج جستجو برای: product of graphs
تعداد نتایج: 21192675 فیلتر نتایج به سال:
let $g$ be a graph and $chi^{prime}_{aa}(g)$ denotes the minimum number of colors required for an acyclic edge coloring of $g$ in which no two adjacent vertices are incident to edges colored with the same set of colors. we prove a general bound for $chi^{prime}_{aa}(gsquare h)$ for any two graphs $g$ and $h$. we also determine exact value of this parameter for the cartesian product of ...
For any integer $k\geq 3$ , we define sunlet graph of order $2k$, denoted by $L_{2k}$, as the consisting a cycle length $k$ together with pendant vertices, each adjacent to exactly one vertex cycle. In this paper, give necessary and sufficient conditions for existence $L_{8}$-decomposition tensor product wreath complete graphs.
The first multiplicative Zagreb index $Pi_1(G)$ is equal to the product of squares of the degree of the vertices and the second multiplicative Zagreb index $Pi_2(G)$ is equal to the product of the products of the degree of pairs of adjacent vertices of the underlying molecular graphs $G$. Also, the multiplicative sum Zagreb index $Pi_3(G)$ is equal to the product of the sum...
the wiener index is a graph invariant that has found extensive application in chemistry. inaddition to that a generating function, which was called the wiener polynomial, who’sderivate is a q-analog of the wiener index was defined. in an article, sagan, yeh and zhang in[the wiener polynomial of a graph, int. j. quantun chem., 60 (1996), 959969] attainedwhat graph operations do to the wiener po...
let $g=(v,e)$ be a connected graph. the eccentric connectivity index of $g$, $xi^{c}(g)$, is defined as $xi^{c}(g)=sum_{vin v(g)}deg(v)ec(v)$, where $deg(v)$ is the degree of a vertex $v$ and $ec(v)$ is its eccentricity. the eccentric distance sum of $g$ is defined as $xi^{d}(g)=sum_{vin v(g)}ec(v)d(v)$, where $d(v)=sum_{uin v(g)}d_{g}(u,v)$ and $d_{g}(u,v)$ is the distance between $u$ and $v$ ...
in this paper, we verify the solvability of free product of finite cyclic groups with topological methods. we use cayley graphs and everitt methods to construct suitable 2-complexes corresponding to the presentations of groups and their commutator subgroups. in particular, using these methods, we prove that the commutator subgroup of $mathbb{z}_{m}*mathbb{z}_{n}$ is free of rank $(m-1)(n-1)$ fo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید