B. Senthilkumar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
B. Senthilkumar has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Hari Naresh Kumar
SASTRA Deemed University
2 shared publications - Selvaraj Balachandran
Sastra university, India
2 shared publications - Venkatakrishnan Balasubramanian Yanamandram
Department of Mathematics, SASTRA University, Tanjore, India
2 shared publications H. Naresh Kumar
School of Arts Sciences Humanities and Education, SASTRA Deemed to be University, Thanjavur 613 401, India
1 shared publicationS. P. Raja
School of Computer Science and Engineering, Vellore Institute of Technology, Vellore 632 014, Tamilnadu, India
1 shared publicationY. B. Venkatakrishnan
School of Arts Sciences Humanities and Education, SASTRA Deemed to be University, Thanjavur 613 401, India
1 shared publication
Latest Publications
- 29 May 2024
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 17 (03)
First Zagreb index and edge-vertex domination in trees
Let [ ] be a simple connected graph. The first Zagreb index denoted by [ ] is defined as [ ]. We present a lower bound for [ ] in terms of order and edge-vertex domination number for trees and characterized the extremal trees attaining the bound.
- 29 May 2024
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 17 (03)
First Zagreb index and edge-vertex domination in trees
Let [ ] be a simple connected graph. The first Zagreb index denoted by [ ] is defined as [ ]. We present a lower bound for [ ] in terms of order and edge-vertex domination number for trees and characterized the extremal trees attaining the bound.
- 18 April 2024
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 17 (02)
Modified Zagreb index and total domination in trees
Let [ ] be a simple connected graph. The modified first Zagreb index is denoted by [ ] is defined as [ ]. We present a lower bound for [ ] in terms of order and total domination number for trees and characterize the extremal trees attaining the bound.
- 18 April 2024
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 17 (02)
Modified Zagreb index and total domination in trees
Let [ ] be a simple connected graph. The modified first Zagreb index is denoted by [ ] is defined as [ ]. We present a lower bound for [ ] in terms of order and total domination number for trees and characterize the extremal trees attaining the bound.