Standard

Super Domination Polynomial of a Graph. / Kaidash, Polina A.

Communications in Computer and Information Science. Springer Science and Business Media Deutschland GmbH, 2024. p. 85-95 6 (Communications in Computer and Information Science; Vol. 2239 CCIS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Kaidash, PA 2024, Super Domination Polynomial of a Graph. in Communications in Computer and Information Science., 6, Communications in Computer and Information Science, vol. 2239 CCIS, Springer Science and Business Media Deutschland GmbH, pp. 85-95, 23rd International Conference on Mathematical Optimization Theory and Operations Research, Омск, Russian Federation, 30.06.2024. https://doi.org/10.1007/978-3-031-73365-9_6

APA

Kaidash, P. A. (2024). Super Domination Polynomial of a Graph. In Communications in Computer and Information Science (pp. 85-95). [6] (Communications in Computer and Information Science; Vol. 2239 CCIS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-73365-9_6

Vancouver

Kaidash PA. Super Domination Polynomial of a Graph. In Communications in Computer and Information Science. Springer Science and Business Media Deutschland GmbH. 2024. p. 85-95. 6. (Communications in Computer and Information Science). doi: 10.1007/978-3-031-73365-9_6

Author

Kaidash, Polina A. / Super Domination Polynomial of a Graph. Communications in Computer and Information Science. Springer Science and Business Media Deutschland GmbH, 2024. pp. 85-95 (Communications in Computer and Information Science).

BibTeX

@inproceedings{30d033fa32d34a04b93e8091c650cccb,
title = "Super Domination Polynomial of a Graph",
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.",
keywords = "Dominating set, Domination polynomial, Super dominating set, Super domination polynomial",
author = "Kaidash, {Polina A.}",
year = "2024",
month = dec,
day = "20",
doi = "10.1007/978-3-031-73365-9_6",
language = "English",
isbn = "978-303173364-2",
series = "Communications in Computer and Information Science",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "85--95",
booktitle = "Communications in Computer and Information Science",
address = "Germany",
note = "23rd International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2024 ; Conference date: 30-06-2024 Through 06-07-2024",

}

RIS

TY - GEN

T1 - Super Domination Polynomial of a Graph

AU - Kaidash, Polina A.

N1 - Conference code: 23

PY - 2024/12/20

Y1 - 2024/12/20

N2 - 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.

AB - 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.

KW - Dominating set

KW - Domination polynomial

KW - Super dominating set

KW - Super domination polynomial

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-85214231592&origin=inward&txGid=669c9a787cc8e68ae19471d97d4fe200

UR - https://www.mendeley.com/catalogue/f933081f-7ed5-3c1a-8133-356fa946650d/

U2 - 10.1007/978-3-031-73365-9_6

DO - 10.1007/978-3-031-73365-9_6

M3 - Conference contribution

SN - 978-303173364-2

T3 - Communications in Computer and Information Science

SP - 85

EP - 95

BT - Communications in Computer and Information Science

PB - Springer Science and Business Media Deutschland GmbH

T2 - 23rd International Conference on Mathematical Optimization Theory and Operations Research

Y2 - 30 June 2024 through 6 July 2024

ER -

ID: 61412712