Covering C4⨁e by the same label

Authors

  • M. Acharya Maharshi Dayanand College, Mumbai, India
  • S. Ghogare Maharshi Dayanand College, Mumbai, India

DOI:

https://doi.org/10.31926/but.mif.2025.5.67.2.15

Keywords:

feasible labeling, covered graph

Abstract

In this paper we have proven a result for a covered graph with at least one subgraph C4⨁e. We have also mentioned some observations and conditions for a graph containing C4⨁e. An algorithm along with the flowchart, that describes the impact of covering a specified C4⨁e with a common label is described by us.

Author Biographies

M. Acharya, Maharshi Dayanand College, Mumbai, India

Department of Mathematics 

S. Ghogare, Maharshi Dayanand College, Mumbai, India

Department of Mathematics

Downloads

Published

2025-06-05

Issue

Section

COMPUTER SCIENCE