.
-
BIOCHEMISTRY OF FASTING – A REVIEW ON METABOLIC SWITCH AND AUTOPHAGY.
Volume - 13 | Issue-1
-
ONE-POT ENVIRONMENT FRIENDLY SYNTHESIS OF IMINE DERIVATIVE OF FURFURAL AND ASSESSMENT OF ITS ANTIOXIDANT AND ANTIBACTERIAL POTENTIAL
Volume - 13 | Issue-1
-
MODELING AND ANALYSIS OF MEDIA INFLUENCE OF INFORMATION DIFFUSION ON THE SPREAD OF CORONA VIRUS PANDEMIC DISEASE (COVID-19)
Volume - 13 | Issue-1
-
INCIDENCE OF HISTOPATHOLOGICAL FINDINGS IN APPENDECTOMY SPECIMENS IN A TERTIARY CARE HOSPITAL IN TWO-YEAR TIME
Volume - 13 | Issue-1
-
SEVERITY OF URINARY TRACT INFECTION SYMPTOMS AND THE ANTIBIOTIC RESISTANCE IN A TERTIARY CARE CENTRE IN PAKISTAN
Volume - 13 | Issue-1
THE CONNECTED OPEN DETOURMONO-PHONIC NUMBER OF A GRAPH
Main Article Content
Abstract
For a graph G that has at least two vertices. If G[M] is connecteԀ, an ????????????????????????????????????????mono-phonic set M is termed a ???????????????????????????????????? ???????????????? ????????????????????????mono-phonic set. The lowest number of a connecteԀ open Ԁetourmono-phonic set of G is the connecteԀ open Ԁetourmono-phonic number ???????????????? (????). The ???????????????? -set of G is any connecteԀ open Ԁetourmono-phonic set of order ???????????????? (????). We determined the ???????????????? (????) of certain standard graphs and achieved some findings in this work. For a connecteԀ graph G, it is demonstrated that There is an integer n such that ???????????????? (????) = ???? for any pair of positive integers k,n with 3 ≤ ???? ≤ ????.
Article Details
