مرور Volume 2, Issue 4 بر اساس عنوان

در حال نمایش موارد 1 - 4 از 4

  • Directionally $n$-signed graphs-III‎: ‎the notion of symmetric‎ ‎balance 

    Reddy, P.Siva Kota؛ Misra, U. K. (University of Isfahan, 2013-12-01)
    ‎Let $G=(V‎, ‎E)$ be a graph‎. ‎By emph{directional labeling (or‎ ‎d-labeling)} of an edge $x=uv$ of $G$ by an ordered $n$-tuple‎ ‎$(a_1,a_2,dots,a_n)$‎, ‎we mean a labeling of the edge $x$ such that‎ ‎we consider the label ...

  • Full friendly index sets of slender and flat cylinder graphs 

    Shiu, Wai Chee؛ Ho, Man-Ho (University of Isfahan, 2013-12-01)
    ‎Let $G=(V,E)$ be a connected simple graph‎. ‎A labeling $f:V to Z_2$ induces an edge labeling‎ ‎$f^*:E to Z_2$ defined by $f^*(xy)=f(x)+f(y)$ for each $xy in E$‎. ‎For $i in Z_2$‎, ‎let‎ ‎$v_f(i)=|f^{-1}(i)|$ and ...

  • Graph theoretical methods to study controllability and leader selection for dead-time systems 

    Najafi, Majdeddin؛ Shaikholeslam, Farid (University of Isfahan, 2013-12-01)
    In this article a graph theoretical approach is employed to study some specifications of dynamic systems with time delay in the inputs and states‎, ‎such as structural controllability and observability‎. ‎First‎, ‎the zero ...

  • Reciprocal degree distance of some graph operations 

    Pattabiraman, Kannan؛ Vijayaragavan, M. (University of Isfahan, 2013-12-01)
    The reciprocal degree distance (RDD)‎, ‎defined for a connected graph $G$ as vertex-degree-weighted sum of the reciprocal distances‎, ‎that is‎, ‎$RDD(G) =sumlimits_{u,vin V(G)}frac{d_G(u)‎ + ‎d_G(v)}{d_G(u,v)}.$ The ...