#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2012

2017

- This year (2)
- Last 5 years (16)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sudeep Stephen, Bharati Rajan, Joseph F. Ryan, Cyriac Grigorious, Albert William
- J. Discrete Algorithms
- 2015

- Cyriac Grigorious, Paul D. Manuel, Mirka Miller, Bharati Rajan, Sudeep Stephen
- Applied Mathematics and Computation
- 2014

- Patrick Andersen, Cyriac Grigorious, Mirka Miller
- Discrete Math., Alg. and Appl.
- 2016

- B. Rajan, I. Rajasingh, S. Stephen, C. Grigorious
- 2012 Second International Conference on Digital…
- 2012

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… (More)

- Sudeep Stephen, Bharati Rajan, Cyriac Grigorious, Albert William
- Applied Mathematics and Computation
- 2015

A metric basis is a set W of vertices of a graph G(V, E) such that for every pair of vertices u, v of G, there exists a vertex w ∈ W with the condition that the length of a shortest path from u to w is different from the length of a shortest path from v to w. The minimum cardinality of a metric basis for G is called the metric dimension. A pair of vertices… (More)

The minimum rank of a simple graph G is the smallest possible rank over all symmetric real matrices A whose nonzero off-diagonal entries correspond to the edges of G. Using the zero forcing number, we prove that the minimum rank of the butterfly network is 1 9 (3r + 1)2 r+1 − 2(−1) r and that this is equal to the rank of its adjacency matrix.

- Cyriac Grigorious, Sudeep Stephen, Bharati Rajan, Mirka Miller
- Comput. J.
- 2017

- Bharati Rajan, Indra Rajasingh, Sudeep Stephen, Cyriac Grigorious
- DICTAP
- 2012

The set of eigenvalues of a graph together with their multiplicities is called the spectrum of. 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… (More)

Let G = (V, A) be a directed graph without parallel arcs, and let S ⊆ V be a set of vertices. Let the sequence S = S0 ⊆ S1 ⊆ S2 ⊆ · · · be defined as follows: S1 is obtained from S0 by adding all out-neighbors of vertices in S0. For k 2, S k is obtained from S k−1 by adding all vertices w such that for some vertex v ∈ S k−1 , w is the unique out-neighbor of… (More)