Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Nabilah Najmuddin"'
Publikováno v:
MATEMATIKA. 35:149-155
A domination polynomial is a type of graph polynomial in which its coefficients represent the number of dominating sets in the graph. There are many researches being done on the domination polynomial of some common types of graphs but not yet for gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07b11dcde39f4c3d0cfda0523b95c699
https://doi.org/10.11113/matematika.v35.n2.1106
https://doi.org/10.11113/matematika.v35.n2.1106
Publikováno v:
Malaysian Journal of Fundamental and Applied Sciences. 14:434-438
The independence and clique polynomial are two types of graph polynomial that store combinatorial information of a graph. The independence polynomial of a graph is the polynomial in which its coefficients are the number of independent sets in the gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28d1f19c3992a5f9bd83e99d9e965dfe
https://doi.org/10.11113/mjfas.v14n0.1268
https://doi.org/10.11113/mjfas.v14n0.1268
Publikováno v:
Malaysian Journal of Fundamental and Applied Sciences. 13:602-605
An independent set of a graph is a set of pairwise non-adjacent vertices. The independence polynomial of a graph is defined as a polynomial in which the coefficient is the number of the independent set in the graph. Meanwhile, a graph of a group G is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b635fda1f5dfac3b51f01cb576b4c96d
https://doi.org/10.11113/mjfas.v0n0.709
https://doi.org/10.11113/mjfas.v0n0.709
Publikováno v:
Journal of Physics: Conference Series. 1988:012072
An independence polynomial is a type of graph polynomial from graph theory that store combinatorial information such as the graph properties or graph invariants. The independence polynomial of a graph contains coefficients that represent the number o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d898133549fc273c31e6dc914a464301
https://doi.org/10.1088/1742-6596/1988/1/012072
https://doi.org/10.1088/1742-6596/1988/1/012072
Publikováno v:
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND TECHNOLOGY 2018 (MATHTECH2018): Innovative Technologies for Mathematics & Mathematics for Technological Innovation.
A dominating set S of a graph is a subset of the vertex set of the graph in which the closed neighborhood of S is the whole vertex set. A domination polynomial of a graph contains coefficients that represent the number of dominating sets in the graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f98527bb82e399a938ba95a0dbfecf66
https://doi.org/10.1063/1.5136363
https://doi.org/10.1063/1.5136363
Publikováno v:
AIP Conference Proceedings.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c03db903de2c3a93e0ed29b53bd9cd05
https://doi.org/10.1063/1.5041649
https://doi.org/10.1063/1.5041649
Publikováno v:
Malaysian Journal of Fundamental and Applied Sciences. 13
An independent set of a graph is a set of pairwise non-adjacent vertices while the independence number is the maximum cardinality of an independent set in the graph. The independence polynomial of a graph is defined as a polynomial in which the coeff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3bac96e99ec91b4449f2bf45d01ea29
https://doi.org/10.11113/mjfas.v13n3.550
https://doi.org/10.11113/mjfas.v13n3.550