SOME PROPERTIES ABOUT DISTANCE DEGREE REGULAR GRAPHS

1. Introbuetion In paper [1], G. S. Bloom and others presented the concept of distance degree regular (DDR)graph, and discussed some fundamental properties about this class of graphs. In this paper, we mainIy consider the properties about graphical operations of DDR-graphs. In addition, we will give a class of DDR-graph having some special properties to demonstrate the variety and complexity of the structure of DDR-graphs. The graphs considered in the paper are all finite