Themonophonic Vertex Covering Number Of A Graph

Authors

  • S. Durai raj, k. A. Francis jude shini, x. Lenin xaviour, anto. A. M

DOI:

https://doi.org/10.17762/msea.v71i4.1908

Abstract

Fora connected graph Gof order n  ? 2, a set s of vertices of G

is monophonicvertexcoverofGifSisbothamonophonicsetandavertexcover of G.  Theminimumcardinalityofamonophonicvertex coverofG iscalledthe monophonic vertex covering numberof G and is denoted by m?(G). Any monophonic vertex cover of cardinality m?(G) is a m?-set of G. Some general propertiessatisfied by monophonic vertex cover are studied. The monophonic vertex coveringnumbers of several classes of graphs are determined. A few realization results aregivenfortheparameterm?(G).

2020 Mathematical Subject Classification: AMS-05C12

Downloads

Published

2023-02-01

How to Cite

S. Durai raj, k. A. Francis jude shini, x. Lenin xaviour, anto. A. M. (2023). Themonophonic Vertex Covering Number Of A Graph. Mathematical Statistician and Engineering Applications, 71(4), 10450–10458. https://doi.org/10.17762/msea.v71i4.1908

Issue

Vol. 71 No. 4 (2022)

Section

Articles