Cyriac Grigorious
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Cyriac Grigorious has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Sudeep Stephen
School of Mathematical and Physical Sciences The University of Newcastle 2308 Callaghan NSW Australia
9 shared publications Bharati Rajan
7 shared publicationsAlbert William
4 shared publicationsMirka Miller
School of Mathematical and Physical Sciences, The University of Newcastle, Callaghan, NSW 2308, Australia
3 shared publicationsIndra Rajasingh
Department of Mathematics, Loyola College, Chennai, India
2 shared publications- Bharati Rajan
Loyola College
1 shared publication
Latest Publications
- Open Access
- 20 October 2016
- Published by Oxford University Press (OUP) in The Computer Journal
On the Partition Dimension of Circulant Graphs
For a vertex v of a connected graph G (V, E) and a subset S of V, the distance between v and S is defined by d(v,S)=min{d(v,x):x∈S}d(v,S)=min{d(v,x):x∈S} . For an ordered k-partition Π={S1,S2,…,Sk}Π={S1,S2,…,Sk} of V, the representation of v with respect to Π is the k-vector r(v∣Π)=(d(v,S1),d(v,S2),…,d(v,Sk))r(v∣Π)=(d(v,S1),d(v,S2),…,d(v,Sk)) . The k-partition Π is a resolving partition if the k-vectors r(v∣Π)r(v∣Π) , v∈Vv∈V are distinct. The minimum k for which there is a resolving k-partition of V is the partition dimension of G. In this paper, we obtain the partition dimension of circulant graphs G=C(n,±{1,2,…,j}),1<j<⌊n2⌋G=C(n,±{1,2,…,j}),1n≥(j+k)(j+1)n≥(j+k)(j+1) and n≡k(mod2j)n≡k(mod2j) as, pd(G)=j+1{whenjisevenandgcd(k,2j)=1,whenjisoddandk=2m,1≤m≤j.pd(G)=j+1{whenjisevenandgcd(k,2j)=1,whenjisoddandk=2m,1≤m≤j.
- 20 October 2016
- Published by Oxford University Press (OUP) in The Computer Journal
Open AccessOn the Partition Dimension of Circulant Graphs
For a vertex v of a connected graph G (V, E) and a subset S of V, the distance between v and S is defined by d(v,S)=min{d(v,x):x∈S}d(v,S)=min{d(v,x):x∈S} . For an ordered k-partition Π={S1,S2,…,Sk}Π={S1,S2,…,Sk} of V, the representation of v with respect to Π is the k-vector r(v∣Π)=(d(v,S1),d(v,S2),…,d(v,Sk))r(v∣Π)=(d(v,S1),d(v,S2),…,d(v,Sk)) . The k-partition Π is a resolving partition if the k-vectors r(v∣Π)r(v∣Π) , v∈Vv∈V are distinct. The minimum k for which there is a resolving k-partition of V is the partition dimension of G. In this paper, we obtain the partition dimension of circulant graphs G=C(n,±{1,2,…,j}),1<j<⌊n2⌋G=C(n,±{1,2,…,j}),1n≥(j+k)(j+1)n≥(j+k)(j+1) and n≡k(mod2j)n≡k(mod2j) as, pd(G)=j+1{whenjisevenandgcd(k,2j)=1,whenjisoddandk=2m,1≤m≤j.pd(G)=j+1{whenjisevenandgcd(k,2j)=1,whenjisoddandk=2m,1≤m≤j.
- 1 July 2015
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 33, 10-18
Power domination in certain chemical structures
- 1 July 2015
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 33, 10-18
Power domination in certain chemical structures
- 7 May 2015
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 9 (2) , 201-208
On the Strong Metric Dimension of Tetrahedral Diamond Lattice
- 7 May 2015
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 9 (2) , 201-208
On the Strong Metric Dimension of Tetrahedral Diamond Lattice
- 1 April 2015
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 256, 778-785
Resolving-power dominating sets
- 1 April 2015
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 256, 778-785
Resolving-power dominating sets
- 1 December 2014
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 248, 47-54
On the metric dimension of circulant and Harary graphs
- 1 December 2014
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 248, 47-54
On the metric dimension of circulant and Harary graphs
- 1 December 2014
- Published by American Scientific Publishers in Quantum Matter
- Vol. 3 (6) , 505-509
Comparative Study of C80 and B80 Fullerenes Based on Various Molecular Descriptors
- 1 December 2014
- Published by American Scientific Publishers in Quantum Matter
- Vol. 3 (6) , 505-509
Comparative Study of C80 and B80 Fullerenes Based on Various Molecular Descriptors
- 1 July 2014
- Published by Elsevier in Information Processing Letters
- Vol. 114 (7) , 353-356
On the partition dimension of a class of circulant graphs
- 1 July 2014
- Published by Elsevier in Information Processing Letters
- Vol. 114 (7) , 353-356
On the partition dimension of a class of circulant graphs
- 1 May 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 400-403
Spectrum of Sierpiski triangles using MATLAB
The set of eigenvalues of a graph G together with their multiplicities is called the spectrum of G. The knowledge of spectrum can be used to obtain various topological properties of graphs like connectedness, toughness and many more. In this paper we use MATLAB to completely describe the spectrum of Sierpiński graphs and Sierpiński triangles, thus adding to the classes of graphs whose spectrum is known.
- 1 May 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 400-403
Spectrum of Sierpiski triangles using MATLAB
The set of eigenvalues of a graph G together with their multiplicities is called the spectrum of G. The knowledge of spectrum can be used to obtain various topological properties of graphs like connectedness, toughness and many more. In this paper we use MATLAB to completely describe the spectrum of Sierpiński graphs and Sierpiński triangles, thus adding to the classes of graphs whose spectrum is known.
- 1 May 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 404-408
Energy of grid based networks using MATLAB
Eigenvalues of a graph are the eigenvalues of its adjacency matrix. The multiset of eigenvalues is called the spectrum. There are many properties which can be explained using the spectrum like energy, connectedness, vertex connectivity, chromatic number, and perfect matching etc. So it is very useful to calculate the spectrum of any graph. The energy of a graph is the sum of the absolute values of its eigenvalues. In this paper we calculate the energy of some grid based networks.
- 1 May 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 404-408
Energy of grid based networks using MATLAB
Eigenvalues of a graph are the eigenvalues of its adjacency matrix. The multiset of eigenvalues is called the spectrum. There are many properties which can be explained using the spectrum like energy, connectedness, vertex connectivity, chromatic number, and perfect matching etc. So it is very useful to calculate the spectrum of any graph. The energy of a graph is the sum of the absolute values of its eigenvalues. In this paper we calculate the energy of some grid based networks.