A Lucky Edge Geometric Mean Labeling (LEGML) is a function μ that assigns the integers to the vertices of graph G such that for every edge as ‘{E}’, uv∈E(G) there exists a function μ*:E(G) → N is defined by μ* (uv) = √μ(u)μ(v) (or) √μ(u)μ(v) with the state that μ* (uv) ≠ μ* (vw) whenever {u} and {vw} have a common vertex as {v}. A minor number ‘k→ E = {1, 2, 3 … k} is the LEGML of G and is signified by h¢GM(G). A result that accepts LEGML is the Lucky Edge Geometric Mean Graph (LEGMG). The idea of the Graph Theory (GT) concept is fused into the Electric Circuit (EC), and the related complicated problems are transformed into graph model representation problems; as a result, the valuation method is simplified and optimized. Network analysis means finding the current or voltage in each branch. One application of GT is the representation of EC. An ‘E’ in a diagram can signify anything in an EC. Each part of the diagram can represent a port or a terminal in the EC. In this article, we have to investigate the Middle Graph (MG) of the star, the Total Graph (TG) of the star, and the central graph (CG) of the star, which accepts LEGML and LEGMG. This method also computes the power consumed by all the resistors of the EC by LEGML.
Authors: P. Mariaraja, Hussein Z. Almngoshi, C. M. Hilda Jerlin, S. Muthuperumal, K Amarendra, Sudhakar Sengan, Pankaj Dadheech
DOI: https://doi.org/10.47974/jdmsc-2086
Publish Year: 2024
