Equivalence of labeled graphs and lattices
Congressus Numerantium · 18.05.2026 · 237 · 37-49
DOI: 10.61091/cn237-03 ↗Kurz gefasst
Fachartikel in der Zeitschrift Congressus Numerantium, online erschienen am 18.05.2026. Verfasst von A. N. Bhavale.
Abstract (Originalsprache)
In \(1973\), Harary and Palmer posed the problem of enumeration of labeled graphs on \(n \geq 1\) unisolated vertices and \(l \geq 0\) edges. In \(1997\), Bender et al. obtained a recurrence relation representing the sequence \(A054548\)(OEIS) of labeled graphs on \(n \geq 0\) unisolated vertices containing \(q \geq \frac{n}{2}\) edges. In \(2020\), Bhavale and Waphare obtained a recurrence relation representing the sequence of fundamental basic blocks on \(n \geq 0\) comparable reducible elements, having nullity \(l \geq \lfloor \frac{n+1}{2} \rfloor\). In this paper, we prove the equivalence of these two sequences. We also provide an edge labeling for a given vertex labeled finite simple graph.
Zitieren
APA
Bhavale, A. N. (2026). Equivalence of labeled graphs and lattices. Congressus Numerantium, 237, 37-49. https://doi.org/10.61091/cn237-03
Vancouver
Bhavale AN. Equivalence of labeled graphs and lattices. Congressus Numerantium. 2026;237:37-49. doi:10.61091/cn237-03
BibTeX
@article{Bhavale2026,
author = {Bhavale, A. N.},
title = {Equivalence of labeled graphs and lattices},
journal = {Congressus Numerantium},
year = {2026},
volume = {237},
pages = {37--49},
doi = {10.61091/cn237-03}
}
EUVIMED