مرور Volume 1, Issue 1 بر اساس عنوان
در حال نمایش موارد 1 - 4 از 4
-
Complexity indices for the travelling salesman problem and data mining
(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$ ...
-
Minimal, vertex minimal and commonality minimal CN-dominating graphs
(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 ...
-
Note on edge distance-balanced graphs
(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 ...
-
Product-cordial index and friendly index of regular graphs
(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$, ...
