Degree affinity number of certain \(2\)-regular graphs
2020 ◽
Vol 3
(3)
◽
pp. 77-84
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.
1999 ◽
Vol 173
◽
pp. 185-188
Keyword(s):
2000 ◽
Vol 179
◽
pp. 163-165
Keyword(s):
1973 ◽
Vol 31
◽
pp. 336-337
1991 ◽
Vol 49
◽
pp. 584-585
2000 ◽
Vol 111
(2)
◽
pp. 662-667
◽
1999 ◽
Vol 197-198
(1-3)
◽
pp. 205-216
◽
1997 ◽
Vol 103
(1)
◽
pp. 107-108
Keyword(s):