Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
Volume 52 (2020)
Volume 51 (2019)
Volume 50 (2018)
Volume 49 (2017)
Volume 48 (2016)
Issue 1
December 2016
Volume 47 (2016)
Volume 46 (2015)
Volume 45 (2014)
Volume 44 (2013)
Volume 43 (2009)
Volume 42 (2008)
Volume 41 (2007)
Number of Articles: 12
Deciding Graph non-Hamiltonicity via a Closure Algorithm
Volume 48, Issue 1 , December 2016, Pages 1-35
Abstract
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 n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, ... Read MoreOn the tenacity of cycle permutation graph
Volume 48, Issue 1 , December 2016, Pages 37-44
Abstract
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 between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation ... Read MoreA note on 3-Prime cordial graphs
Volume 48, Issue 1 , December 2016, Pages 45-55
Abstract
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)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number ... Read MoreEdge pair sum labeling of some cycle related graphs
Volume 48, Issue 1 , December 2016, Pages 57-68
Abstract
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*: V (G) → Z - {0} defi ned by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are ... Read More4-Prime cordiality of some classes of graphs
Volume 48, Issue 1 , December 2016, Pages 69-79
Abstract
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)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number ... Read MoreFurther results on odd mean labeling of some subdivision graphs
Volume 48, Issue 1 , December 2016, Pages 81-98
Abstract
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, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defi ned by f*(uv) = (f(u) + f(v))/2 if f(u) ... Read MoreAn Optimization Model for Epidemic Mitigation and Some Theoretical and Applied Generalizations
Volume 48, Issue 1 , December 2016, Pages 99-116
Abstract
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 infected nodes from the others. By using this model we nd an exact optimal solution ... Read MoreConstructing Graceful Graphs with Caterpillars
Volume 48, Issue 1 , December 2016, Pages 117-125
Abstract
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, given by the absolute di erence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling ... Read MoreTotal vertex irregularity strength of corona product of some graphs
Volume 48, Issue 1 , December 2016, Pages 127-140
Abstract
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 calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum ... Read MoreA Survey on Stability Measure of Networks
Volume 48, Issue 1 , December 2016, Pages 141-148
Abstract
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 and upper bounds for tenacity. Read MoreTowards a measure of vulnerability, tenacity of a Graph
Volume 48, Issue 1 , December 2016, Pages 149-153
Abstract
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 parameters have been used to describe the vulnerability of communication networks, including ... Read MoreA Survey On the Vulnerability Parameters of Networks
Volume 48, Issue 1 , December 2016, Pages 155-162