Publications by authors named "Jayakrishna Udupa H"

Background: In graph theory, M polynomials like the matching polynomial are very crucial in examining the matching structures within graphs, while NM polynomials extends this to analyze non-matching edges. These polynomials are important in many fields, including chemistry and network architecture. They support the derivation of topological indices for protein structure analysis, network communication optimization, and drug design in QSAR/QSPR investigations.

View Article and Find Full Text PDF