On The Study of Edge Monophonic Vertex Covering Number
For a connected graph G of order n ≥ 2, a set S of vertices of G is an edge monophonic vertex cover of G if S is both an edge monophonic set and a vertex covering set of G. The minimum cardinality of an edge monophonic vertex cover of G is called the edge monophonic vertex covering number of G and i...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Accademia Piceno Aprutina dei Velati
2022-12-01
|
Series: | Ratio Mathematica |
Subjects: | |
Online Access: | http://eiris.it/ojs/index.php/ratiomathematica/article/view/907 |