The present study investigates the pendant number of certain graph classes; complement, line graphs, and total graphs. The pendant number is the minimum number of end vertices of paths in a path decomposition of a graph. A path decomposition of a graph is a decomposition of it in...
Open access
Research Article10.9734/jamcs/2023/v38i41756
A Mӧbius Transformation or a Fractional Linear Transformation is a complex-valued function that maps points in the extended complex plane into itself either by translations, dilations, inversions, or rotations or even as a combination of the four mappings. Such a mapping can be c...
Open access
Research Article10.9734/arjom/2022/v18i730390
In the field of graph theory, the complete graph of vertices is a simple undirected graph such that every pair of distinct vertices is connected by a unique edge. In the present work, we introduce planar subgraph of with maximal number of edges . Generally, does not admit pr...
Open access
Research Article10.9734/jamcs/2021/v36i130333