2 papers
math.CO2016
On the Fractional fixing number of graphs
Hira Benish, Iqra Irshad, Min Feng +1
An automorphism group of a graph is the set of all permutations of the vertex set of that preserve adjacency and non adjacency of vertices in a graph. A fixing set of a gra…
math.CO2016
On the zero forcing number of corona and lexicographic product of graphs
I. Javaid, I. Irshad, M. Batool +1
The zero forcing number of a graph , denoted by , is the minimum cardinality of a set of black vertices (where vertices in are colored white) such th…