Largest cliques in connected supermagic graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Largest cliques in connected supermagic graphs


A graph $G=(V,E)$ is said to be $\textit{magic}$ if there exists an integer labeling $f: V \cup E \to [1, |V \cup E|]$ such that $f(x)+f(y)+f(xy)$ is constant for all edges $xy \in E$. Enomoto, Masuda and Nakamigawa proved that there are magic graphs of order at most $3n^2+o(n^2)$ which contain a complete graph of order $n$. Bounds on Sidon sets show that the order of such a graph is at least $n^2+o(n^2)$. We close the gap between those two bounds by showing that, for any given graph $H$ of order $n$, there are connected magic graphs of order $n^2+o(n^2)$ containing $H$ as an induced subgraph. Moreover it can be required that the graph admits a supermagic labelling $f$, which satisfies the additional condition $f(V)=[1,|V|]$.
Fichier principal
Vignette du fichier
dmAE0143.pdf (125.4 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01184371 , version 1 (14-08-2015)



Anna Lladó. Largest cliques in connected supermagic graphs. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.219-222, ⟨10.46298/dmtcs.3414⟩. ⟨hal-01184371⟩


43 View
472 Download



Gmail Facebook Twitter LinkedIn More