Fixed-horizon planning considers a weighted graph and asks to construct path that maximizes the sum of weights for given time horizon T. However, in many scenarios, is not fixed, but stopping chosen according some distribution such expected If stopping-time known, then ensure robustness, by an adversary as worst-case scenario. A stationary plan every vertex always chooses same outgoing edge. Fo...

‎Let $G$ be a finite group‎. ‎An element $gin G$ is called non-vanishing‎, ‎if for‎ ‎every irreducible complex character $chi$ of $G$‎, ‎$chi(g)neq 0$‎. ‎The bi-Cayley graph ${rm BCay}(G,T)$ of $G$ with respect to a subset $Tsubseteq G$‎, ‎is an undirected graph with‎ ‎vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(tx,2)}mid xin G‎, ‎ tin T}$‎. ‎Let ${rm nv}(G)$ be the set‎ ‎of all non-vanishi...

Let $G$ be a non-abelian group. The non-commuting graph $Gamma_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joined if and only if they do not commute.In this paper we study some properties of $Gamma_G$ and introduce $n$-regular $AC$-groups. Also we then obtain a formula for Szeged index of $Gamma_G$ in terms of $n$, $|Z(G)|$ and $|G|...

let $g$ be a non-abelian group. the non-commuting graph $gamma_g$ of $g$ is defined as the graph whose vertex set is the non-central elements of $g$ and two vertices are joined if and only if they do not commute.in this paper we study some properties of $gamma_g$ and introduce $n$-regular $ac$-groups. also we then obtain a formula for szeged index of $gamma_g$ in terms of $n$, $|z(g)|$ and $|g|...

‎let $g$ be a finite group‎. ‎an element $gin g$ is called non-vanishing‎, ‎if for‎ ‎every irreducible complex character $chi$ of $g$‎, ‎$chi(g)neq 0$‎. ‎the bi-cayley graph $bcay(g,t)$ of $g$ with respect to a subset $tsubseteq g$‎, ‎is an undirected graph with‎ ‎vertex set $gtimes{1,2}$ and edge set ${{(x,1),(tx,2)}mid xin g‎, ‎ tin t}$‎. ‎let $nv(g)$ be the set‎ ‎of all non-vanishing element...