Abstract
Objectives: Let be a finite and connected graph with β points and d edges. In this research, introduced the graph's minimum maximal dominating seidel energy ( and the properties of the latent roots of the given parameters are discussed. Method: In this research, the seidel energy of several graphs and its properties are investigated. Examined its minimum maximal limits and computed a few conventional seidel energy outcomes for the minimum maximal dominating graphs. Finding: Using the minimum maximal dominating seidel energy of graphs, significant outcomes were achieved for complete graphs, complete bipartite graphs, and star graphs. The properties of the class of graphs were computed. The established upper and lower bound is . Novelty: The seidel energy of the proposed research findings is used in various graphs based on the research. The fundamental characteristics of a graph, such as its energy upper and lower bounds, have been determined, and this knowledge has found notable chemical applications in the conjugated molecular orbital theory. Recommendations for future energy-related research are presented and examined. Keywords: Connected graph, Dominating set, Latent roots, Minimum maximal, Seidel energy
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
