Given a graph with n points and m lines. If each vertex is labeled, then it can be constructed many graphs, connected, or disconnected graphs. A graph G is called a connected graph if there is at ...least one path that connects a pair of vertices in G. In addition, the graph formed may be simple or not simple. A simple graph is a graph that does not contain loops or parallel lines. A loop is a line that connects a point to itself, and a parallel line is two or more lines that connect the same pair of points. This paper will discuss the relationship between the formula patterns for calculating the number of connected graphs labeled with vertices of order five and six without loops.
Bilangan Kromatik Lokasi Graf Split Lintasan Siti Rahmatalia; Asmiati Asmiati; Notiragayu Notiragayu
Jurnal matematika integratif (Online),
05/2022, Letnik:
18, Številka:
1
Journal Article
Recenzirano
Odprti dostop
Bilangan kromatik lokasi graf merupakan pengembangan dari konsep dimensi partisi dan pewarnaan titik suatu graf. Banyaknya warna minimum dalam pewarnaan lokasi dari graf disebut bilangan kromatik ...lokasi dari graf , dilambangkan dengan . Pada paper ini akan dibahas tentang bilangan kromatik lokasi pada graf split lintasan yang dinotasikan dan graf barbel split lintasan yang dinotasikan dengan .
Encryption-decryption algorithm using a mapping can be done for encoding a digital text, such as two dimensional mapping ΔΔ-sine Gordon equation. In this article, we will be given an ...encryption-decryption algorithm to a digital text through a three dimensional mapping that derived from the generalized ΔΔ-mKdV equation. Implementation of Encryption-decryption algorithm in this article using MATHEMATICA.
Transportation problems are one of the particular forms that often appear in linear programs, one of which is the distribution of goods. A transportation method is needed to determine the optimal ...result, namely, the minimum cost from source to destination with all demand and supply fulfilled. There are several methods, one of which is the Lowest Supply Lowest Cost Method (LSLC) and the Exponential Approach Method (PE). Both methods are made in a MATLAB program, generating a script that calculates the algorithm's time complexity. Using the function notation, the Big-O Algorithm complexity of the Lowest Supply Lowest Cost method is more efficient than the Exponential Approach Method algorithm. At the same time, the optimal result for the minimum cost between the two methods is obtained by using the Exponential Approach Method.
A labeled graph is a graph where each vertex or edge is given a value or label. A line/edge with the same starting and ending vertex is called a loop. If given n vertices and m edges, then there are ...lot disconnected vertices labeled graphs that can be formed. Among those graphs, there are graphs with maximum seven loops and whose non-loop edges are even. In this research, we will discuss the formula for finding that kinds of graphs.
If given a graph G(V,E) with n vertices and m edges many graphs can be constructed. The graphs constructed maybe connected graphs (there exists at least one path connecting every pair of vertices in ...the graph) or disconnected; either simple a (contains loop or parallel edges) or not simple. In, this paper we will discuss the formula for counting the number of connected vertex labelled graph of order five (n=5) without loops, witof h minimum five edges and maa y contaiof n maximum ten parallel edges.
The minimum number of colors in a locating coloring of G is called the locating chromatic number of graph G, denoted by χL(G). Split graph of cycle with a set of vertices {υ1, υ2, υ3, ..., υn} is ...graph obtained by adding on vertex υi as many new k vertices υi1,υi2,υi3,...,υik, so that each vertices υi1,υi2,υi3,...,υik neighbouring with each vertex that is neighbouring to vertex vi in the cycle graph. Split graph of cycle, denoted by spl(Cn) In this paper will be discussed about the locating chromatic number for split graph of cycle.
In this research, we aim to find the most efficient route from the Lampung Provincial Education Office to various State Senior High Schools in Lampung Province, employing both the Dijkstra Algorithm ...and the A* (A-Star) Algorithm. To address this problem, we model it as a weighted graph, where the vertices represent the locations of the Lampung Provincial Education Office and the Public High Schools, and the edges' weights represent the distances. Furthermore, we implement the solution using the Python programming language. The outcomes demonstrate that both algorithms yield optimal results with the same distance and route. However, when considering the execution time of the program, the A* (A-Star) algorithm outperforms Dijkstra's Algorithm because it quickly identifies the shortest path from the starting point to the destination, whereas Dijkstra's Algorithm explores the shortest paths from neighboring points first.
This paper is concerned with a mathematical derivation of the nonlinear time-discrete Technology Emission Means (TEM) model that discuss its behavior from the perspective of discrete dynamical ...systems. Nonlinear time-discrete dynamics tends to chaotic behavior. The addition of a control parameter into the dynamics of this model has led to new results in the field of time-discrete control systems. In this paper, we added another control parameter into the TEM model in the form of regulation. More ever we discuss stability theory of the TEM model, numerical solutions and compare their behavior before and after the addition of the regulatory control parameter. Finally, we obtained that by adding regulatory control parameter more stable than before.
PDF
