نتایج جستجو برای: Generalized Petersen graphs
تعداد نتایج: 261658 فیلتر نتایج به سال:
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
Generalized Petersen graphs are an important class of commonly used interconnection networks and have been studied . The total domination number of generalized Petersen graphs P(m,2) is obtained in this paper.
In this paper we establish a theorem on the maximum number of vertices of a generalized Petersen graph as a function of the diameter.
The generalized Petersen graphs are a type of cubic graph formed by connecting the vertices regular polygon to corresponding star polygon. This has many interesting properties. As result, it been widely researched. In this work, edge metric dimensions GP(2l + 1, l) and GP(2l, explored, is shown that dimension equal its dimension. Furthermore, proved upper bound same as value for l).
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید