EUVIMEDEUVIMED entdecken
Crossref

Word-Representation of Melon Graphs

Khyodeno Mozhui, K. V. Krishna

Graphs and Combinatorics · 2026-04 · 42 (2)

DOI: 10.1007/s00373-026-03029-5 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Graphs and Combinatorics, online erschienen am 06.03.2026. Verfasst von Khyodeno Mozhui und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 32 Literaturangaben. Gefördert von: Council of Scientific and Industrial Research, India.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Förderung

  • Council of Scientific and Industrial Research, India

Zitieren

APA

Mozhui, K., & Krishna, K. V. (2026). Word-Representation of Melon Graphs. Graphs and Combinatorics, 42(2). https://doi.org/10.1007/s00373-026-03029-5

Vancouver

Mozhui K, Krishna KV. Word-Representation of Melon Graphs. Graphs and Combinatorics. 2026;42(2). doi:10.1007/s00373-026-03029-5

BibTeX
@article{Mozhui2026,
  author = {Mozhui, Khyodeno and Krishna, K. V.},
  title = {Word-Representation of Melon Graphs},
  journal = {Graphs and Combinatorics},
  year = {2026},
  volume = {42},
  number = {2},
  doi = {10.1007/s00373-026-03029-5}
}
Kostenlos starten →