Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2602.14179

Word-Representation of Melon Graphs

Khyodeno Mozhui·K. V. Krishna
View original source ↗Read source document ↗Export metadata ↓

Abstract

The notion of word-representable graphs is a generalization of comparability graphs, in which graphs are represented by words. The complexity of word-representation of a word-representable graph is captured through the representation number, whereas the corresponding concept is the permutation-representation number for comparability graphs. The graphs with the (permutation-)representation number at most two were characterized in the literature. While certain examples in the class of graphs with the (permutation-)representation number three are known, no characterization for these classes is available. In this work, we prove that the representation number of melon graphs is at most three. Further, we characterize the class of melon graphs restricted to comparability graphs and show that their permutation-representation number is also at most three. Moreover, this work characterizes the word-representable line graphs of melon graphs and establishes that their representation number is at most three.

Explore related subjects

math.COcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Khyodeno Mozhui, K. V. Krishna. 2026-02-15. Word-Representation of Melon Graphs. https://arxiv.org/abs/2602.14179

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗