Bimonthly    Since 1986
ISSN 1004-9037
Publication Details
Edited by: Editorial Board of Journal of Data Acquisition and Processing
P.O. Box 2704, Beijing 100190, P.R. China
Sponsored by: Institute of Computing Technology, CAS & China Computer Federation
Undertaken by: Institute of Computing Technology, CAS
Published by: SCIENCE PRESS, BEIJING, CHINA
Distributed by:
China: All Local Post Offices
 
   
      09 May 2023, Volume 38 Issue 3
    Article

    THE MONOPHONIC VERTEX COVERING NUMBER OF POWER OF CYCLES
    S. Durai Raj1, K. A. Francis Jude Shini2, X. Lenin Xaviour3, A. M. Anto4
    Journal of Data Acquisition and Processing, 2023, 38 (3): 1115-1120 . 

    Abstract

    Let C_n^k be the kth power of cycle C_n. A set S of vertices of C_n^k is a monophonic vertex cover of C_n^k if S is both a monophonic set and a vertex cover of C_n^k. The minimum cardinality of a monophonic vertex cover of C_n^k is called the monophonic vertex covering number of power of cycles and is denoted by m_α(C_n^k). Any monophonic vertex cover of cardinality m_α(C_n^k) is a m_α-set of C_n^k. Some general properties satisfied by monophonic vertex cover of power of cycles are studied.

    Keyword

    monophonic set, vertex covering set, monophonic vertex cover, monophonic vertex covering number, power of cycles, monophonic vertex covering number of power of cycles


    PDF Download (click here)

SCImago Journal & Country Rank

ISSN 1004-9037

         

Home
Editorial Board
Author Guidelines
Subscription
Journal of Data Acquisition and Processing
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
E-mail: info@sjcjycl.cn
 
  Copyright ©2015 JCST, All Rights Reserved