{"product_id":"total-labeling-of-some-families-of-trees-and-cycles-with-chords-von-muhammad-hussain","title":"Total labeling of some families of trees and cycles with chords","description":"\u003cp\u003eA labeling (or valuation) of a graph is a map that  carries the graph elements to numbers (usually to  the  positive integers). The domain will usually be the  set of all vertices and edges; such labelings are  called total labelings. In the case when all  vertices  receive smallest labels, then edge-magic total  (vertex-magic total) labeling is called super edge- magic total labeling (super vertex-magic total  labeling). Some labelings use the vertex set or the  edge set alone and they will be referred as vertex- labeling and edge-labeling respectively. Other  domains are also possible. There are many types of  labelings for example harmonious, cordial, graceful  and antimagic.        This book studies about the construction of a  super edge-magic total la-beling of banana tree as  well as for disjoint union of k identical copies of  banana trees. We also construct the antimagic total  labelings of Harary graphs\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783838331539\"\u003e\u003ch3\u003eLabeling\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783838331539","offer_id":39498907451485,"sku":"9783838331539","price":49.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/0429ac87-576c-4593-8b93-2f76dedd1c1c.jpg?v=1758087523","url":"https:\/\/shop.autorenwelt.de\/products\/total-labeling-of-some-families-of-trees-and-cycles-with-chords-von-muhammad-hussain","provider":"Autorenwelt Shop","version":"1.0","type":"link"}