On coefficients of edge domination polynomial of a graph. (3rd March 2016)

• Record Type: Journal Article
• Authors: Chaluvaraju, B.; Chaitra, V.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 19:Number 2(2016)
• Page Start: 413
• Page End: 423
• Publication Date: 2016-03-03
• Subjects: Graph -- edge domination number -- domination polynomial -- edge domination polynomial; 05C69 -- 05C70; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2015.1107974
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: An edge domination polynomial of a graph G is the polynomial where d e ( G, t ) is the number of edge dominating sets of G of cardinality t . In this paper, we provide tables which contain coefficient of edge domination polynomial of path and cycle. Also, certain properties of edge dominating polynomial are given.