Graphs whose certain polynomials have few distinct roots (Q470526): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
Summary: Let \(G=(V,E)\) be a simple graph. Graph polynomials are a well-developed area useful for analyzing properties of graphs. We consider domination polynomial, matching polynomial, and edge cover polynomial of \(G\). Graphs which their polynomials have few roots can sometimes give surprising information about the structure of the graph. This paper is primarily a survey of graphs whose domination polynomial, matching polynomial, and edge cover polynomial have few distinct roots. In addition, some new unpublished results and questions are concluded. | |||
| Property / review text: Summary: Let \(G=(V,E)\) be a simple graph. Graph polynomials are a well-developed area useful for analyzing properties of graphs. We consider domination polynomial, matching polynomial, and edge cover polynomial of \(G\). Graphs which their polynomials have few roots can sometimes give surprising information about the structure of the graph. This paper is primarily a survey of graphs whose domination polynomial, matching polynomial, and edge cover polynomial have few distinct roots. In addition, some new unpublished results and questions are concluded. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C31 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6368843 / rank | |||
Normal rank | |||
Revision as of 16:30, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs whose certain polynomials have few distinct roots |
scientific article |
Statements
Graphs whose certain polynomials have few distinct roots (English)
0 references
12 November 2014
0 references
Summary: Let \(G=(V,E)\) be a simple graph. Graph polynomials are a well-developed area useful for analyzing properties of graphs. We consider domination polynomial, matching polynomial, and edge cover polynomial of \(G\). Graphs which their polynomials have few roots can sometimes give surprising information about the structure of the graph. This paper is primarily a survey of graphs whose domination polynomial, matching polynomial, and edge cover polynomial have few distinct roots. In addition, some new unpublished results and questions are concluded.
0 references
