مرور Volume 48, Issue 1 بر اساس تاریخ انتشار

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

  • Total vertex irregularity strength of corona product of some graphs 

    Jeyanthi, P.؛ Sudha, A. (University of Tehran, 2016-12-01)
    A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights ...

  • An Optimization Model for Epidemic Mitigation and Some Theoretical and Applied Generalizations 

    Ranjbarfard, Sima؛ Ghodousian, Amin؛ Moazzami, D. (University of Tehran, 2016-12-01)
    In this paper, we present a binary-linear optimization model to prevent the spread of an infectious disease in a community. The model is based on the remotion of some connections in a contact network in order to separate ...

  • A Survey On the Vulnerability Parameters of Networks 

    Shabankhah, Mahmood (University of Tehran, 2016-12-01)
    The analysis of vulnerability in networks generally involves some questions about how the underlying graph is connected. One is naturally interested in studying the types of disruption in the network that maybe caused by ...

  • On the tenacity of cycle permutation graph 

    Jelodar, D.؛ Moazzami, D.؛ Nasehpour, P. (University of Tehran, 2016-12-01)
    A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn( α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching ...

  • Towards a measure of vulnerability, tenacity of a Graph 

    Moazzami, Dara (University of Tehran, 2016-12-01)
    If we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. Many graph theoretical ...

  • Edge pair sum labeling of some cycle related graphs 

    Jeyanthi, P.؛ Saratha Devi, T. (University of Tehran, 2016-12-01)
    Let G be a (p,q) graph. An injective map f : E(G) → { ±1,± 2,...,± q} is said to be an edge pair sum labeling if the induced vertex function f *: ...

  • 4-Prime cordiality of some classes of graphs 

    Ponraj, R.؛ Singh, Rajpal؛ Sathish Narayanan, S.؛ Ramasamy, A. M. S. (University of Tehran, 2016-12-01)
    Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). ...

  • Further results on odd mean labeling of some subdivision graphs 

    Vasuki , R.؛ Suganthi, S.؛ Pooranam, G. (University of Tehran, 2016-12-01)
    Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, ...

  • Deciding Graph non-Hamiltonicity via a Closure Algorithm 

    Swart, E. R.؛ Gismondi, Stephen J.؛ Swart, N. R.؛ Bell, C. E.؛ Lee, A. (University of Tehran, 2016-12-01)
    We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the ...

  • A note on 3-Prime cordial graphs 

    Ponraj, R.؛ Singh, Rajpal؛ Sathish Narayanan, S. (University of Tehran, 2016-12-01)
    Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). ...

  • Constructing Graceful Graphs with Caterpillars 

    Barrientos , Christian؛ Minion, Sarah (University of Tehran, 2016-12-01)
    A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, ...

  • A Survey on Stability Measure of Networks 

    Nasehpour, Peyman (University of Tehran, 2016-12-01)
    In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower ...