LAUSR

Proper Disconnection of Graphs

Sign Up to like & get
recommendations!
1 Published in 2019 at "Bulletin of the Malaysian Mathematical Sciences Society"

DOI: 10.1007/s40840-020-01069-5

Abstract: For an edge-colored graph G , a set F of edges of G is called a proper edge-cut if F is an edge-cut of G and any pair of adjacent edges in F are assigned… read more here.

Keywords: edge cut; connected graph; proper disconnection; disconnection ... See more keywords