Some Results on the Erdős-Faber-Lovász Conjecture
Sign Up to like & getrecommendations! Published in 2022 at "Symmetry"
DOI: 10.3390/sym14071327
Abstract: Erdős–Faber–Lovász conjecture states that if a graph G is a union of the n edge-disjoint copies of complete graph Kn, that is, each pair of complete graphs has at most one shared vertex, then the… read more here.
Keywords: conjecture; shared vertex; complete graphs; erd faber ... See more keywords
On local antimagic total labeling of complete graphs amalgamation
Sign Up to like & getrecommendations! Published in 2023 at "Opuscula Mathematica"
DOI: 10.7494/opmath.2023.43.3.429
Abstract: Let \(G = (V,E)\) be a connected simple graph of order \(p\) and size \(q\). A graph \(G\) is called local antimagic (total) if \(G\) admits a local antimagic (total) labeling. A bijection \(g :… read more here.
Keywords: amalgamation; complete graphs; antimagic total; local antimagic ... See more keywords