A graph operation and its applications in generating orderenergetic and equienergetic graphs
Subin P. Joseph
Abstract
Open-access reader
Subin P. Joseph
Abstract
Open-access reader
A general graph operation is defined and some of its applications are given in this paper. The adjacency spectrum of any graph generated by this operation is given. A method for generating integral graphs using this operation is discussed. Corresponding to any given graph, we can generate an infinite sequence of pair of equienergetic non-cospectral graphs using this graph operation. Given an orderenergetic graph, it is shown that we can construct two different sequences of orderenergetic graphs. A condition for generating orderenergetic graphs from non-orderenergetic graphs are also derived. This method of constructing connected orderenergetic graphs solves one of the open problem stated in the paper by Akbari et al.(2020).
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
A general graph operation is defined and some of its applications are given in this paper. The adjacency spectrum of any graph generated by this operation is given. A method for generating integral graphs using this operation is discussed. Corresponding to any given graph, we can generate an infinite sequence of pair of equienergetic non-cospectral graphs using this graph operation. Given an orderenergetic graph, it is shown that we can construct two different sequences of orderenergetic graphs. A condition for generating orderenergetic graphs from non-orderenergetic graphs are also derived. This method of constructing connected orderenergetic graphs solves one of the open problem stated in the paper by Akbari et al.(2020).
Key concepts: Graph product, Combinatorics, Mathematics, Block graph, Line graph, Pathwidth, Cograph, Adjacency list