Answers are grounded in this paper and cite their sources.
A method for construction of the characteristic polynomial (CP) coefficients of the three classes of reciprocal graphs, viz., Ln + n(p), Cn + n(p), and K1,n−1 + n(p), has been developed that requires only the value of n. The working formulas have been expressed in matrix product form, computer programs for which can easily be developed.
No takes yet. Share an insight, caveat, or question.
Mandal et al. (2004) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: