Please enable JavaScript.

Coggle requires JavaScript to display documents.

Count (Un-directed Graphs (connected (with n vertices), not necessarily…

- - - - Vertices are labelled
        
        No. of Distinct Cycles of length 4 ?
- - - - number of components in resultant G
- - - - congruent to ? modulo 4
- - - - no cycle
      - atleast 1 cycle
    - - on removal of any edge
      - on removal of any two edges
- - - - Degree of all vertices can-not be distinct
- - - - each vertex at least degree 3
        
        maxm. value of n?
- - - - With more than 2 vertices
        
        no 2 vertices have same degree
        
        atleast 3 vertices have same degree
        
        atleast 2 vertices have same degree
        
        all vertices have same degree
- - - - n > 2