A MATHEMATICAL MODELING OF CAMPUS INFORMATION SYSTEM

Abstract

An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, \sum\limits_{v∈V (H)}{f(v)}+\sum\limits_{e∈E(H)}{ f(e)} is constant. f is said to be H-V -super magic if f(V (G)) = {1, 2, ..., p}. Suppose that V (G) = U(G) ∪ W(G) with |U(G)| = m and |W(G)| = n. Then f is said to be H-V -super-strong magic labeling if f(U(G)) = {1, 2, ..., m} and f(W(G)) = {m + 1, m + 2, ...,(m + n = p)}. A graph that admits a H-V -super-strong magic labeling is called a H-V -super-strong magic decomposable graph. In this paper, we pay our attention to provide a mathematical modeling of campus information system.

Keywords

• H-decomposable graph
• H-V -super-strong magic labeling
• complete bipartite graph