
Degree affinity number of certain \(2\)-regular graphs
Author(s) -
Johan Kok
Publication year - 2020
Publication title -
open journal of discrete applied mathematics
Language(s) - English
Resource type - Journals
eISSN - 2617-9687
pISSN - 2617-9679
DOI - 10.30538/psrp-odam2020.0046
Subject(s) - degree (music) , combinatorics , mathematics , graph , discrete mathematics , physics , acoustics
This paper furthers the study on a new graph parameter called the degree affinity number. The degree affinity number of a graph \(G\) is obtained by iteratively constructing graphs, \(G_1,G_2,\dots,G_k\) of increased size by adding a maximal number of edges between distinct pairs of distinct vertices of equal degree. Preliminary results for certain \(2\)-regular graphs are presented.