Nandi, RajuRajuNandi2025-08-282025-08-282023-12-012331-842210.48550/arXiv.2312.08691https://d8.irins.org/handle/IITG2025/20155A new class of simple symmetric digraphs called D is defined and studied here. Any digraph in D has the property that each non-pendant is adjacent to at least one pendant vertex. A graph theoretical description for the entries of the group inverse of a real square matrix A with any digraph belonging to this class is given. We classify all the real square matrix A such that the digraphs associated with A and A# both are in D, that is the digraph related to A is either a corona or a star digraph.en-USe-Printe-Print123456789/555