Volume 5, Issue 3
مرور بر اساس
ارسال های اخیر
-
A new $O(m+k n log overline{d})$ algorithm to find the $k$ shortest paths in acyclic digraphs
(University of Isfahan, 2016-09-01)We give an algorithm, called T$^{*}$, for finding the k shortest simple paths connecting a certain pair of nodes, $s$ and $t$, in a acyclic digraph. First the nodes of the graph are labeled according ...
-
Steiner Wiener index of graph products
(University of Isfahan, 2016-09-01)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 Steiner ...
-
A new construction for vertex decomposable graphs
(University of Isfahan, 2016-09-01)Let $G$ be a finite simple graph on the vertex set $V(G)$ and let $S subseteq V(G)$. Adding a whisker to $G$ at $x$ means adding a new vertex $y$ and edge $xy$ to $G$ where $x in V(G)$. The graph $Gcup W(S)$ is obtained ...
-
Extreme edge-friendly indices of complete bipartite graphs
(University of Isfahan, 2016-09-01)Let $G=(V,E)$ be a simple graph. An edge labeling $f:Eto {0,1}$ induces a vertex labeling $f^+:Vto Z_2$ defined by $f^+(v)equiv sumlimits_{uvin E} f(uv)pmod{2}$ for each $v in V$, where $Z_2={0,1}$ is the additive group ...
