Harmonious graphs from α-trees

Harmonious graphs from α-trees

Two of the most studied graph labelings are the types of harmonious and graceful. A harmonious labeling of a graph of size m and order n, is an injective assignment of nonnegative integers smaller than m, such that the weights of the edges, which are defined as the sum of the labels of the end-verti...

पूर्ण विवरण

में बचाया:
ग्रंथसूची विवरण
मुख्य लेखकों: Barrientos, Christian; Valencia College, Orlando, FL 32832, U.S.A (लेखक), Minion, Sarah; Full Sail University, Winter Park, FL 32792, U.S.A (लेखक)
स्वरूप: EJournal Article
प्रकाशित: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2021-10-16.
विषय:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
ऑनलाइन पहुंच:Get Fulltext
टैग : टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!

इंटरनेट

Get Fulltext

3rd Floor Main Library

होल्डिंग्स विवरण से 3rd Floor Main Library
बोधानक: A1234.567
प्रति 1 उपलब्ध

समान संसाधन