Searcharxiv⌕ Search

arXiv subjects

Meilin Imelda Tilukay

Publications and source records attributed to Meilin Imelda Tilukay.

3 recordsLinked to original sources

Bounded Multilinear Functionals and Multicontinuous Functions on n-Normed Spaces

In this paper, we introduced some notions on the n-Normed Spaces. Those are bounded k-linear (or multilinear) functionals and k-continuous (or multicontinuous) functions with k \in \mathbb{N}. We defined k-linear functionals under several types of boundedness, and constructed the corresponding dual spaces based on each type of boundedness. We then proved that these types of boundedness are actually equivalent. This means the boundedness of a multilinear functional can be verified using any of the equivalent notions of boundedness that we defined earlier. The equivalent also implies that all of the resulting dual spaces are identical as a set. We also defined two norms on the dual spaces and showed that both norms are equivalent. Moreover, we gave some examples of bounded k-linear functionals on an n-normed space and calculated their norms with respect to the types of boundedness. We also defined a new notion of k-continuous function in n-normed spaces. Then we gave a relation between the bounded k-linear functional and k-continuous function in n-normed spaces.

math.FA↗

Modular Irregularity Strength of Triangular Book Graph

This paper deals with the modular irregularity strength of a graph of n vertices, a new graph invariant, modified from the irregularity strength, by changing the condition of the vertex-weight set associate to the well-known irregular labeling from n distinct positive integer to Z_n-the group of integer modulo n. Investigating the triangular book graph B_m^((3)), we first find the irregularity strength of triangular book graph s(B_m^((3)) ), as the lower bound for the modular irregularity strength, and then construct a modular irregular s(B_m^((3)) )-labeling. The result shows that triangular book graphs admit a modular irregular labeling and its modular irregularity strength and irregularity strength are equal, except for a small case and the infinity property.

math.CO↗

On H-Irregularity Strength of Grid Graphs

This paper deals with three graph characteristics related to graph covering named the (vertex, edge, and total, resp.) H-irregularity strength of a graph G admitting H-covering. Those are the minimum values of positive integer k such that G has an H-irregular (vertex, edge, and total, resp.) k-labeling. The exact values of these three characteristics are determined for grid graph admitting grid-covering

math.CO↗