Claim Missing Document
Check
Articles

Found 12 Documents
Search

Dynamical Analysis of Predator-Prey Model Leslie-Gower with Omnivore Rina Exviani; Wuryansari Muharini Kusumawinahyu; Noor Hidayat
The Journal of Experimental Life Science Vol. 8 No. 2 (2018)
Publisher : Postgraduate School, Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1306.624 KB) | DOI: 10.21776/ub.jels.2018.008.02.10

Abstract

This article discussed a dynamical analysis on a model of predator-prey Leslie-Gower with omnivores which is modified by Lotka-Volterra model with omnivore. The dynamical analysis is done by determining the equilibrium point with its existing condition and analyzing the local stability of the equilibrium point. Based on the analysis, there are seven points of equilibrium. Three of them always exist while the four others exist under certain conditions. Four points of equilibrium, namely and are unstable, while the others three equilibrium point are local asymptotically stable under certain conditions. Moreover, it's also conducted numerical simulations to illustrate the analytical. The results of numerical simulations agree with the results of the dynamical analysis. Keywords: local stability, omnivore, predator-prey models, the equilibrium point
Total distance vertex irregularity strength of some corona product graphs Dian Eka Wijayanti; Noor Hidayat; Diari Indriati; Abdul Rouf Alghofari; Slamin Slamin
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 1 (2023): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2023.11.1.17

Abstract

A distance vertex irregular total k-labeling of a simple undirected graph G = G(V, E), is a function f : V(G)∪E(G)→{1, 2, …, k} such that for every pair vertices u, v ∈ V(G) and u ≠ v, the weights of u and v are distinct. The weight of vertex v ∈ V(G) is defined to be the sum of the label of vertices in neighborhood of v and the label of all incident edges to v. The total distance vertex irregularity strength of G (denoted by tdis(G)) is the minimum of k for which G has a distance vertex irregular total k-labeling. In this paper, we present several results of the total distance vertex irregularity strength of some corona product graphs.