Research Project

Tangkapan Layar 2026-07-11 pukul 11.51.41
When Mathematics Gives Every Point a Unique Identity

Imagine a city map made only of dots and connecting roads. In mathematics, this structure is called a graph: the dots are vertices, while the connecting lines are edges. Graphs can represent transportation routes, communication systems, social relationships, computer networks, and many other connected structures. A recent study explores a fascinating question: how can numbers be assigned to the edges so that every vertex receives a unique mathematical identity?

Tangkapan Layar 2026-07-11 pukul 11.49.02
How Mathematics Gives Every Network Connection a Unique Identity ?

MAKASSAR, Indonesia June 02 2026/graphtheory/ Imagine a delivery network with many roads, intersections, and shortcuts. To manage it efficiently, each road should be distinguishable from the others. In mathematics, this idea can be studied through graph theory, where intersections are represented as vertices and roads as edges. A recent study explains how a carefully selected group of vertices can be used to uniquely identify every edge in a complex network.

1-s2.0-S2215016125004315-ga1_lrg
How Flower-Shaped Networks Can Give Every Connection a Unique Identity?

MAKASSAR, Indonesia May 15 2026/graphtheory/ Flowers are often admired for their symmetry, but in mathematics, flower-like patterns can also help researchers understand complex networks. A recent study investigates two special structures—the modified sunflower graph and the flower petal graph—and develops a mathematical method for giving every point in these networks a unique identity.

Tangkapan Layar 2026-07-11 pukul 11.42.46
Can Mathematics Help Cities Find Smarter Routes?

MAKASSAR, Indonesia May 2 2026/graphtheory/ Traffic congestion is not only a daily inconvenience. It can waste fuel, increase travel time, raise stress levels, and reduce the efficiency of public services. Researchers often use mathematics to understand such problems before new systems are built. One useful approach comes from graph theory, a branch of mathematics that represents places as points and routes as connecting lines.

Tangkapan Layar 2026-07-11 pukul 13.01.46
Giving Every Point a Unique Identity: The Mathematics Behind Symmetrical Networks

MAKASSAR, Indonesia Apr 2 2026/graphtheory/ In mathematics, this structure is called a dodecahedral graph. It contains points connected by lines in a highly regular pattern. Because of its symmetry, many parts of the network can look identical. This creates an interesting challenge: how can every point be given a unique mathematical identity without using unnecessarily large numbers?

Tangkapan Layar 2026-07-11 pukul 13.02.46
When Groups of Circles Become a Mathematical Navigation Puzzle

MAKASSAR, Indonesia March 3 2026/graphtheory/ Imagine several circular routes meeting at one common hub. From a distance, the structure looks simple, but identifying every point inside it can be surprisingly difficult. This is the challenge explored in the study “The Partition Dimension of the Vertex Amalgamation of Some Cycles.”

The research belongs to graph theory, a branch of mathematics used to study networks. In a graph, points are called vertices and the links between them are called edges. A cycle graph is a closed loop, similar to a circular road. Vertex amalgamation means joining several cycle graphs at one shared vertex, creating a flower-like network with one central meeting point.

Tangkapan Layar 2026-07-11 pukul 13.03.31
Can Mathematics Give Every Point in a Network a Unique Identity?

MAKASSAR, Indonesia Feb 2 2026/graphtheory/ Imagine a network of roads, computers, or social connections in which every point must be recognized without confusion. Graph theory offers a mathematical way to study this problem. In a graph, points are called vertices and the links between them are called edges. The article “Another Antimagic Conjecture” explores how numbers can be assigned to vertices so that every point receives a unique total value based on its surroundings.

The idea is called D-antimagic labeling. First, every vertex is given a different number. Then, for each vertex, researchers add the labels of other vertices located at selected distances, represented by a set DD. The resulting sum becomes that vertex’s weight. A labeling is D-antimagic when all vertices have different weights.

Tangkapan Layar 2026-07-11 pukul 13.03.58
Giving Every Shape on a Map Its Own Mathematical Fingerprint

MAKASSAR, Indonesia Jan 2 2026/graphtheory/ Imagine drawing a road map on a sheet of paper. Intersections become points, roads become lines, and the spaces enclosed by those roads become regions. In graph theory, these are called vertices, edges, and faces. A study titled “H-Irregularity Strengths of Plane Graphs” asks a fascinating question: how can numbers be assigned to these elements so that repeated substructures can always be told apart?

The research focuses on plane graphs, meaning graphs drawn on a flat surface without edges crossing. The authors introduce two new mathematical measures: vertex–face H-irregularity strength and edge–face H-irregularity strength. Although the terminology sounds complex, the basic idea is simple.

Screenshot 2025-01-08 at 18.02.53
Development of Irregular Interconnection Network Based on Graph Labeling

One way for processors to communicate data is to use a shared memoryand shared variables. However this is unrealistic for large numbers of processors. A more realistic assumption is that each processor has its own private memory and data communication takes place using message passing through an interconnection network. The interconnection network plays a central role in determining the overall performance of a multicomputer system. An interconnection network may be modeled by a simple graph whose vertices represent components of the network and whose edges represent physical communication links, where directed edges represent one-way communication links and undirected edges represent two-way communication links, and the incidence function specifies a way that components of the network are interconnected by links. Such a graph is called the topological structure of the interconnection network, or network topology.

Some interconnection network topologies are designed and some borrow from nature. For example hypercubes, complete binary trees, butterflies and torus networks are some of the designed architectures. Grids, hexagonal networks, honeycomb networks and diamond networks, for instance, bear resemblance to atomic or molecular lattice structures.They are called natural architectures. (Indra Rajasingh, Bharati Rajan, S. Teresa Arockiamary, Irregular total labeling of grid network, J.Comp. & Math. Sci. Vol. 2(6), 888-892w (2011)

In this research, we will development interconnection network based on graph labeling, especially in total irregular interconnection network. The long term goal of this research is to enhance previous results that have been obtained by other researchers on the total edge irregularity strength (tes) and the total vertex irregularity strength (tvs) of any interconnection network system. As a special target of this research will be obtaine the total edge and the total vertex irregularity strength of the interconnection network system constructed by a diamond interconnection network.

To achieve these objectives, the method used is to determine the total irregularity strength of diamond interconnection network with a partition separating to even and odd partitions. In general, the determination of the total irregularity strength will done in two stages, namely the first stage of the lower bound is determined by using the properties of the interconnection network. The second stage is to determine the upper bound by constructing a function on the interconnection network.

Research will be conducted in Hasanuddin University Indonesia and in Technical University Kosice – Slovak Republic. In Hasanuddin University Indonesia, we will completely the first stage. Besides that, we will construction of special functions for the diamond interconnection network for simple cases. While the research will be carried out in Technical University Kosice to generalize results obtained to apply in general of complete diamond interconnection network. The study results will be written in the form paper and will be published to the Journal of Combinatorial Mathematics and Combinatorial Computing or Discrete Mathematics. Moreover, the results also will be presented at the International Conference on Educatioan, Mathematics, and Science 2016.

Screenshot 2025-01-08 at 15.07.37
The edge irregular total labeling of the corona two any graphs

A total edge irregular k-labeling of a graph G is defined as a mapping from the vertex set and the edge set of G to {1 , 2, 3,...,k} such that each edge of G has a distinct weight.The weight of an edge e=xy in E is the sum of the label of x, label of y and the label of e. The total edge irregularity strength of G, denoted by tes(G), is the smallest positive integer k such that G has a total edge irregular k-labeling.

Determination of the total edge irregularity skength of a graph an easy matter because the tes(G) is greatly influenced by the structure and characteristics of the G. Until now only some graph class is already known its the total edge irregularity strength. Miskuf, J. and Jendrol, S (2007) gives the total edge irregularity strength of grids, Nurdin, Baskoro, E.T, Salman, A.N.M., Gaos, N.N (2006, 2008) gives the total edge irregularity strenght of union graph K_{2n}, the corona product of cycles with the complement of complete graphs, and the corona product of paths with some graphs. The goal this project we plan to determine the total edge irregularity strength of the corona product of any two graphs.

In determining the total edge irregularity strenght of corona product of any graphs is used the results have been obtained by Baca et al. (2007) about the lower and above bound of the total edge irregularity strength of any graph. Before will be assessed on the properties of the corona product of graph . Technically, the determination of the total edge irregularity strength of the graph, the graph must be specified lower and upper bound. In determining the lower bound will be taken into account a certain number of edges. As for determining the upper bound, shall be constructed of an edge irregular total labeling on the graph. Of labeling that is constructed is shown that all the weights of its edges are different and the biggest number used is its the total edge irregularity strength.