Neodvisnostni polinom dreves ni vedno logaritemsko konkaven, začenši z redom 26
An independent set in a graph is a collection of vertices that are not adjacent to each other. The cardinality of the largest independent set in G is represented by α(G). The independence polynomial of a graph G = (V, E) was introduced by Gutman and Harary in 1983 and is defined as I(G
Publication Details
- Journal
- Repository of the University of Primorsk (University of Primorska)
- Published
- 2025-07-30
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00