Your selections:
Zero forcing in iterated line digraphs
- Ferrero, Daniela, Kalinowski, Thomas, Stephen, Sudeep
Zero forcing and power domination in graphs
The metric dimension of the circulant graph C(n,±{1,2,3,4})
- Grigorious, Cyriac, Kalinowski, Thomas, Ryan, Joe, Stephen, Sudeep
Resolving-power dominating sets
- Stephen, Sudeep, Rajan, Bharati, Grigorious, Cyriac, William, Albert
Power domination in certain chemical structures
- Stephen, Sudeep, Rajan, Bharati, Ryan, Joe, Grigorious, Cyriac, William, Albert
On the strong metric dimension of tetrahedral diamond lattice
- Manuel, Paul, Rajan, Bharati, Grigorious, Cyriac, Stephen, Sudeep
On the power domination number of de Bruijn and Kautz digraphs
- Grigorious, Cyraic, Kalinowski, Thomas, Stephen, Sudeep
On the partition dimension of circulant graphs
- Grigorious, Cyriac, Stephen, Sudeep, Rajan, Bharati, Miller, Mirka
On the partition dimension of a class of circulant graphs
- Grigorious, Cyriac, Stephen, Sudeep, Rajan, Bharati, Miller, Mirka, William, Albert
On the metric dimension of circulant and Harary graphs
- Grigorious, Cyriac, Manuel, Paul, Miller, Mirka, Rajan, Bharati, Stephen, Sudeep
On the energy of certain recursive structures
- Stephen, Sudeep, Rajan, Bharati, Miller, Mirka, Grigorious, Cyriac, William, Albert
Minimum rank and zero forcing number for butterfly networks
- Ferrero, Daniela, Grigorious, Cyriac, Kalinowski, Thomas, Ryan, Joe, Stephen, Sudeep
Average distance in interconnection networks via reduction theorems for vertex-weighted graphs
- Klavžar, Sandi, Manuel, Paul, Nadjafi-Arani, M. J., Rajan, R. Sundara, Grigorious, Cyriac, Stephen, Sudeep
A lower bound on the zero forcing number
- Davila, Randy, Kalinowski, Thomas, Stephen, Sudeep
Are you sure you would like to clear your session, including search history and login status?