Super domination polynomial of a graph Full article
| Conference |
XXIII International Conference Mathematical Optimization Theory and Operations Research 30 Jun - 6 Jul 2024 , Омск |
||||
|---|---|---|---|---|---|
| Source | Mathematical Optimization Theory and Operations Research: Recent Trends Compilation, Springer. 2024. 388 c. ISBN 978-3-031-73364-2. |
||||
| Journal |
Communications in Computer and Information Science
ISSN: 1865-0929 |
||||
| Output data | Year: 2024, Volume: 2239, Pages: 85–95 Pages count : 11 DOI: 10.1007/978-3-031-73365-9_6 | ||||
| Tags | Dominating set · Super dominating set · Domination polynomial · Super domination polynomial | ||||
| Authors |
|
||||
| Affiliations |
|
Funding (1)
| 1 | Russian Science Foundation | 23-21-00459 |
Abstract:
In this paper, a super domination polynomial of a simple graph G=(V,E) of order |V|=n is introduced as the polynomial Dsp(G,x)=∑i=γsp(G)ndsp(G,i)xi, where γsp(G) is the minimum cardinality of a super dominating set in G and dsp(G,i) is the number of super dominating sets Ssp of G of size i. Some properties of Dsp(G,x) and its coefficients for a given graph G are obtained. Furthermore, explicit formulas of the super domination polynomial of some families of graphs are presented.
Cite:
Kaidash P.A.
Super domination polynomial of a graph
In compilation Mathematical Optimization Theory and Operations Research: Recent Trends. – Springer., 2024. – Т.2239. – C.85–95. – ISBN 978-3-031-73364-2. DOI: 10.1007/978-3-031-73365-9_6 Scopus OpenAlex
Super domination polynomial of a graph
In compilation Mathematical Optimization Theory and Operations Research: Recent Trends. – Springer., 2024. – Т.2239. – C.85–95. – ISBN 978-3-031-73364-2. DOI: 10.1007/978-3-031-73365-9_6 Scopus OpenAlex
Dates:
| Accepted: | Aug 10, 2024 |
| Published print: | Dec 20, 2024 |
| Published online: | Dec 20, 2024 |
Identifiers:
| Scopus: | 2-s2.0-85214231592 |
| OpenAlex: | W4405597626 |
Citing:
Пока нет цитирований