• RELATION BETWEEN TOTAL DOMINATION NUMBER, ENERGY OF A GRAPH AND RANK
Manjula C. Gudgeri, Shailaja S. Shirkol, Pallavi I. Kalmath Varsha
Abstract
Manjula C. Gudgeri, Shailaja S. Shirkol, Pallavi I. Kalmath Varsha
Abstract
D omination theory and energy of a graph are the fastest growing areas within graph theory. The energy of a graph is defined as the sum of the absolute values of all eigen values of its adjacency matrix of a graph. In this paper we present some sharp lower bounds which relate total domination number of a graph G, energy of G and rank of the incident matrix of some class of graphs.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
D omination theory and energy of a graph are the fastest growing areas within graph theory. The energy of a graph is defined as the sum of the absolute values of all eigen values of its adjacency matrix of a graph. In this paper we present some sharp lower bounds which relate total domination number of a graph G, energy of G and rank of the incident matrix of some class of graphs.
Key concepts: Graph energy, Adjacency matrix, Mathematics, Combinatorics, Line graph, Butterfly graph, Regular graph, Voltage graph