نتایج جستجو برای: graph product
تعداد نتایج: 470620 فیلتر نتایج به سال:
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
the wiener index $w(g)$ of a connected graph $g$ is defined as $w(g)=sum_{u,vin v(g)}d_g(u,v)$ where $d_g(u,v)$ is the distance between the vertices $u$ and $v$ of $g$. for $ssubseteq v(g)$, the {it steiner distance/} $d(s)$ of the vertices of $s$ is the minimum size of a connected subgraph of $g$ whose vertex set is $s$. the {it $k$-th steiner wiener index/} $sw_k(g)$ of $g$ ...
Let $R$ be commutative ring with identity and $M$ be an $R$-module. The zero divisor graph of $M$ is denoted $Gamma{(M)}$. In this study, we are going to generalize the zero divisor graph $Gamma(M)$ to submodule-based zero divisor graph $Gamma(M, N)$ by replacing elements whose product is zero with elements whose product is in some submodules $N$ of $M$. The main objective of this pa...
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...
The Narumi-Katayama index is the first topological index defined by the product of some graph theoretical quantities. Let G be a simple graph. Narumi-Katayama index of G is defined as the product of the degrees of the vertices of G. In this paper, we define the Narumi-Katayama polynomial of G. Next, we investigate some properties of this polynomial for graphs and then, we obtain ...
In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.
for two normal edge-transitive cayley graphs on groups h and k which have no common direct factor and gcd(jh=h ′j; jz(k)j) = 1 = gcd(jk=k ′j; jz(h)j), we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.
in this paper, we investigate a problem of finding natural condition to assure the product of two graphs to be hamilton-connected. we present some sufficient and necessary conditions for $gbox h$ being hamilton-connected when $g$ is a hamilton-connected graph and $h$ is a tree or $g$ is a hamiltonian graph and $h$ is $k_2$.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید