/
Your selections:
Minimum rank and zero forcing number for butterfly networks
- Ferrero, Daniela, Grigorious, Cyriac, Kalinowski, Thomas, Ryan, Joe, Stephen, Sudeep
d-lucky labeling of graphs
- Miller, Mirka, Rajasingh, Indra, Emilet, D. Ahima, Jemilet, D. Azubha
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
Are you sure you would like to clear your session, including search history and login status?