Абстрактный

ON AUTOMORPHISM OF LABELED SIMPLE CONNECTED GRAPH FROM PRESCRIBED DEGREES

Bidipta Majumder, Subhajit Guha and Soumyasri Ghosh

On counting of labeled connected graphs, the question comes into mind first; “How many ways a graph can be labeled?” As there exist certain number of labeled isomorphic graphs. On finding non isomorphic labeled graphs is an interesting problem itself. To provide the fact, graph automorphism should be considered.