APAV - Academy of Sciences, Letters, Arts and Technology (E-Journals)
Not a member yet
757 research outputs found
Sort by
On The Roots And Stability Of Vertex Connectivity Polynomial Of Graphs
No full textThe connectedness property of vertices in a graph is not in general preserved after the removal of geodesics connecting them. Infact, the adjacent and nonadjacent vertices in a graph may sometimes differ in terms of ”closeness” and this motivated the authors to generalise the adjacency property by introducing the concept of closely-connected in a graph. More details on closely-connected vertices are discussed in [Priya and Anil Kumar]. The study of vertex-connected vertices in [Priya and Anil Kumar, 2021a] which does not alter graph connectivity triggered the need to define vertex connectivity polynomial discussed in [Priya and Anil Kumar, 2021b] for simple finite connected graphs to explicitly reveal the number of vertex pairs that disconnect a graph. The introduction of vertex connectivity polynomial in [Priya and Anil Kumar, 2021b] resulted in the study of nature of roots as well as the stability properties of the same for various graph classes. This paper mainly deals with results about the nature of roots, stability and schur stability of the vertex connectivity polynomial
Odd Fibonacci Stolarsky-3 Mean Labeling of Some Special Graphs
Get PDFLet G be a graph with p vertices and q edges and an injective function where each is a odd Fibonacci number and the induced edge labeling are defined byand all these edge labeling are distinct is called Odd Fibonacci Stolarsky-3 Mean Labeling. A graph which admits a Odd Fibonacci Stolarsky-3 Mean Labeling is called a Odd Fibonacci Stolarsky-3 mean graph
Connected Hub Sets and Connected Hub Polynomials of the Lollipop Graph L_(p,1)
Get PDFLet be a graph with vertex set . The number of vertices in is the order of and is denoted by . The connected hub polynomial of Gdenoted by is defined as where denotes the number of connected hub sets of of cardinality and denotes the connected hub number of .Let denotes the Lollipop graph with vertices. The connected hub polynomial of denoted by is defined as,where denotes the number of connected hub sets of of cardinality , and denotes the connected hub number of .In this paper, we derive a recursive formula for . From this recursive formula, we construct the connected hub polynomial of as,Also we study some properties of this polynomia
The Detour Domination and Connected Detour Domination values of a graph
Get PDFThe number of -sets that belongs to in G is defined as the detour domination value of indicated by for each vertex . In this article, we examined at the concept of a graph’s detour domination value. The connected detour domination values of a vertex represented as , are defined as the number of -sets to which a vertex belongs to G. Some of the related detour dominating values in graphs’ general characteristics are examined. This concept’s satisfaction of some general properties is investigated. Some common graphs are established
Further Diversification of Nano Binary Open Sets
Get PDFThe purpose of this paper is to introduce and study the nano binary exterior, nano binary border and nano binary derivedin nano binary topological spaces. Also studied their characterization
Markov Chain Model and its Application Yearly Rainfall Data in Nagapattinam District
Get PDFA stochastic model expresses a sequence of possible events in which the possible event of each event depends on the previous event and is called a Markov chain. This paper has analyzed yearly rainfall in the Nagapattinam district and formulated three-state models. The first-order Markov chain to determine the long-term probability of rainfall in the following years and the steady-state. It can be used to make a forecast of the annual rainfall pattern. This model can give some information about rainfall to farmers and the government to plan strategies for high crop production in the Nagapattinam distric
Mixed Picture Fuzzy Graph
Get PDFA new form of picture fuzzy graph has been identified and introduced here as Mixed Picture Fuzzy Graph(MPFG). The picture fuzzy set is made up of the fuzzy set and the intuitionistic fuzzy set. It is helpful when there are multiple options, such as yes, no, rejection and abstain. MPFG, which is dependent on the picture fuzzy relation, is defined in this paper. The properties of various types of degrees, order and size of MPFG are examined. Also some types of MPFG such as regular, strong, complete and complement of MPFG are introduced and their properties were analysed. As an application part, the concept of MPFG has been applied in instagram and the result has been discussed here
An epistemological framework to appreciate the limits of predatory publishing
Get PDFThe concept of “predatory” publishing, despite many studies of the phenomenon, continues to be unclear. This paper visualizes this topic through an epistemological perspective, claiming that these limitations emerge from an impressionism of idealization, the entrapment of cause and effect induced by a journalology-based perspective, and entrenched fantasized extraction, imagination and divination of what constitutes the truth, in essence, a path never followed by an epistēmōn. Reality, proof, verification, recorded observations and their interpretations have been pivoted to fit the theoretical flavor of the day, an entity one day being predatory, the next not. Perhaps ephemeral judgements of predatory have been built on boundless disregard for common sense. Yet, these have led to scientists’ apotheosis, almost oblivious of the intangibility of “valid”, or the infinitesimal continuum of “predatory”. Perhaps their fault-ridden authoritarian argumentative disabilities is at fault
Controlling the Transmission Dynamics of Measles Infection: Sensitivity Analysis and Optimal Control Analysis Approaches
No full textIn this paper, a deterministic model for the transmission dynamics of measles infection with two doses of vaccination and isolation is studied. The disease-free equilibrium state and basic reproduction number,, of the model are computed. The sensitivity analysis of the model parameters is carried out using the Latin Hypercube Sampling (LHS) scheme in other to ascertain the crucial parameters that contribute to the spread of measles in the population. The result of the sensitivity analysis shown that transmission rates, vaccination rates and isolation of the infected persons in prodromal stage are significant parameters to be targeted for the eradication of measles infection. Based on the result of sensitivity analysis, the optimal control analysis is carried out using Pontryagin’s maximum principle to identify the optimal control strategies to be adopted by public health practitioners and policy health makers in curtailing the spread of measles infection. The result of the numerical simulations revealed that combined implementation of timely and correct administration of the two doses of vaccination, isolation of infected persons in prodromal stage and mass distribution of nutritional support will curtail the measles disease outbreak in the population. However, in a situation where there is limited facility to isolated the infected persons in prodromal stage, the combined implementation of mass distribution of nutritional support and administration of the two doses of vaccination will still eradicate measles infection in the population.
Connected 2- Dominating Sets and Connected 2- Domination Polynomials of the Complete Bipartite Graph k_(2,m)
Get PDFLet be a simple graph.Let be the family of connected 2 dominating sets in with cardinality and |.Then the polynomial is called the 2 domination polynomial of where is the connected 2 domination number of Let be the family of connected 2 dominating sets of theComplete bipartite graph with cardinality and let .Then the connected 2 domination polynomial of is defined as where is the connected2 – domination number of .In this paper, we obtain a recursive formula for .Using this recursive formula, we construct the connected 2 domination polynomial is the number of connected 2 dominating sets of of cardinality and some properties of this polynomial have been studie