High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

A Novel Concept of Connecting Edges of a Graph through a Circuit

Author(s):

C. Densley , VELTECH RANGA SANKU ARTS COLLEGE; V. Vadivelu, VELTECH RANGA SANKU ARTS COLLEGE; S. Dinesh, VELTECH RANGA SANKU ARTS COLLEGE

Keywords:

Connecting Edges of a Graph through a Circuit

Abstract

We prove that a connected graph G contains a circuit—a closed walk that repeats no edges—through any k prescribed edges if and providing G contains no odd cut of size at the foremost k.

Other Details

Paper ID: IJSRDV7I70276
Published in: Volume : 7, Issue : 7
Publication Date: 01/10/2019
Page(s): 429-432

Article Preview

Download Article