Wap to check the presence of pendant edges in a Graph using Incident matrix

#include<stdio.h>

#include<conio.h>

void main()

{

  int i,j;

  int count2;

  int m,n,a[10][10];

  clrscr();

  printf("\n @@@ Enter the no of edge and vertice \n-> ");

  scanf ("%d%d",&m,&n);

  printf ("\n Enter the adjacency matrix :  \n");

  for (i=0;i<m;i++)

  {

    for(j=0;j<n;j++)

          {

           scanf("%d",&a[i][j]);

          }

  }

for (i=0;i<m;i++)

 {

   count2=0;

      for (j=0;j<m;j++)

      {

          if(a[i][j]==1)

          {

           count2=count2+1;

          }

      }

          if (count2==1)

          {

                   printf ("\n>>>Pendent edge found  = %d\n",i+1);

          }

          else

          {

          printf (" \n no pendent edge found  = %d",i+1);

          }

 }

 getch();

 }