Volume 1, Issue 1

 

ارسال های اخیر

  • Complexity indices for the travelling salesman problem and data mining 

    Cvetković, Dragos (University of Isfahan, 2012-03-01)
    we extend our previous work on complexity indices for the travelling salesman problem (TSP), summarized in cite{CvCK3}, using graph spectral techniques of data mining. A complexity index is an invariant of an instance $I$ ...

  • On the total domatic number of regular graphs 

    Aram, H.؛ Sheikholeslami, S. M.؛ Volkmann, L. (University of Isfahan, 2012-03-01)
    ‎A set $S$ of vertices of a graph $G=(V,E)$ without isolated vertex‎ ‎is a total dominating set if every vertex of $V(G)$ is‎ ‎adjacent to some vertex in $S$‎. ‎The total domatic number of‎ ‎a graph $G$ is the ...

  • Minimal, vertex minimal and commonality minimal CN-dominating graphs 

    Alwardi, Anwar Saleh؛ Soner, N. D. (University of Isfahan, 2012-03-01)
    We define minimal CN-dominating graph $mathbf {MCN}(G)$‎, ‎commonality minimal CN-dominating graph $mathbf {CMCN}(G)$ and vertex minimal CN-dominating graph $mathbf {M_{v}CN}(G)$‎, ‎characterizations are given for graph ...

  • A note on star coloring of central graph of bipartite graph and corona graph of complete graph with path and cycle 

    Vernold, V. J.؛ Venkatachalam, M. (University of Isfahan, 2012-03-01)
    In this paper, we find the star chromatic number of central graph of complete bipartite graph and corona graph of complete graph with path and cycle.

  • Product-cordial index and friendly index of regular graphs 

    Shiu, Wai Chee؛ Harris, Kwong (University of Isfahan, 2012-03-01)
    Let $G=(V,E)$ be a connected simple graph‎. ‎A labeling $f‎: ‎Vto Z_2$ induces two edge labelings $f^+‎, ‎f^*‎: ‎E to‎ ‎Z_2$ defined by $f^+(xy) = f(x)+f(y)$ and $f^*(xy) =‎ ‎f(x)f(y)$ for each $xy in E$‎. ‎For $i in Z_2$‎, ...

  • $k$-Tuple total domination and mycieleskian graphs 

    P. Kazemi, Adel (University of Isfahan, 2012-03-01)
    ‎Let $k$ be a positive integer‎. ‎A subset $S$ of $V(G)$ in a graph $G$‎ ‎is a $k$-tuple total dominating set of $G$ if every vertex of $G$‎ ‎has at least $k$ neighbors in $S$‎. ‎The $k$-tuple total domination‎ ‎number ...

  • Note on edge distance-balanced graphs 

    Tavakoli, M.؛ Yousefi-Azari, H.؛ Ashrafi, Ali Reza (University of Isfahan, 2012-03-01)
    Edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. In this paper, we study this ...