RMR. Murali
R. Murali
*This is an algorithmically generated author record based on publicly available information.
Research Subjects
R. Murali has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Uppari Vijaya Chandra Kumar
Department of Mathematics, School of Applied Sciences, REVA University, Bengaluru, India
2 shared publications - Anjaneyulu Mekala
Department of Mathematics, Guru Nanak Institutions Technical Campus (Autonomous), Hyderabad, Telangana, India
1 shared publication - B. M. Jayashree
Department of Electronics and Communication Engineering, Dr. Ambedkar Institute of Technology, Bengaluru 560056, Karnataka, India
1 shared publication - K. Kallesh
Department of Mathematics, S.J.C. Institute of Technology, Chickballapur, Karnataka, India
1 shared publication - Kulkarni Sunita Jagannatharao
Department of Mathematics, Dr. Ambedkar Institute of Technology, Bengaluru 560056, Karnataka, India
1 shared publication
Latest Publications
- Open Access
- 25 December 2023
- Published by RGN Publications in Communications in Mathematics and Applications
- Vol. 14 (4) , 1421-1428
Independent Domination Degree of Standard Graphs of Adriatic \((a,b)\)-KA IndicesThe dominating set \(D\) of the graph \(K=(V,E)\) is the independent dominating set (Ids), the independent domination number \(i(K)\) of the graph \(K\) is the minimum cardinality of id. In this article, we introduce the new independent degree domination (idd) of each vertices \(s\in V(K)\), denoted by \(d_{id}(s)\) and compute the Adriatic \((a,b)\)-KA index for book graphs, cycle middle graphs and windmill graphs.- 25 December 2023
- Published by RGN Publications in Communications in Mathematics and Applications
- Vol. 14 (4) , 1421-1428
Open AccessIndependent Domination Degree of Standard Graphs of Adriatic \((a,b)\)-KA IndicesThe dominating set \(D\) of the graph \(K=(V,E)\) is the independent dominating set (Ids), the independent domination number \(i(K)\) of the graph \(K\) is the minimum cardinality of id. In this article, we introduce the new independent degree domination (idd) of each vertices \(s\in V(K)\), denoted by \(d_{id}(s)\) and compute the Adriatic \((a,b)\)-KA index for book graphs, cycle middle graphs and windmill graphs. - Open Access
- 25 December 2023
- Published by RGN Publications in Communications in Mathematics and Applications
- Vol. 14 (4) , 1463-1468
Roman Domination in the Shadow Distance Graphs
A function \(\psi: \mathcal{V} \rightarrow \{0,1,2\}\) satisfying the requirement that each vertex \(x\) for which \(\psi(x)=0\) is adjacent to at least one vertex \(y\) for which \(\psi(y)=2\) is known as a Roman dominating function (Rdf) on a graph. A Rdf's weight is represented by the value \(\psi(y)= \sum_{x\in \mathcal{V}} \psi(x)\). The Roman domination number (Rdn) of a graph \(\mathcal{G}\) is the minimal weight of a Rdf on that graph. In this article, we establish Rdn for the shadow distance graph of the path, cycle, and star graphs with predetermined distance sets.- 25 December 2023
- Published by RGN Publications in Communications in Mathematics and Applications
- Vol. 14 (4) , 1463-1468
Open AccessRoman Domination in the Shadow Distance Graphs
A function \(\psi: \mathcal{V} \rightarrow \{0,1,2\}\) satisfying the requirement that each vertex \(x\) for which \(\psi(x)=0\) is adjacent to at least one vertex \(y\) for which \(\psi(y)=2\) is known as a Roman dominating function (Rdf) on a graph. A Rdf's weight is represented by the value \(\psi(y)= \sum_{x\in \mathcal{V}} \psi(x)\). The Roman domination number (Rdn) of a graph \(\mathcal{G}\) is the minimal weight of a Rdf on that graph. In this article, we establish Rdn for the shadow distance graph of the path, cycle, and star graphs with predetermined distance sets. - Open Access
- 25 December 2023
- Published by RGN Publications in Communications in Mathematics and Applications
- Vol. 14 (4) , 1437-1448
Star Rainbow Coloring in Graphs
In this paper, we define a new coloring parameter called the star rainbow connection number of a connected graph \(G\), denoted by \(st_{rc}(G)\) and determine this parameter for some standard graphs.- 25 December 2023
- Published by RGN Publications in Communications in Mathematics and Applications
- Vol. 14 (4) , 1437-1448
Open AccessStar Rainbow Coloring in Graphs
In this paper, we define a new coloring parameter called the star rainbow connection number of a connected graph \(G\), denoted by \(st_{rc}(G)\) and determine this parameter for some standard graphs.