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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Neodvisnostni polinom dreves ni vedno logaritemsko konkaven, začenši z redom 26

Repository of the University of Primorsk (University of Primorska)
Advanced Graph Theory Research
article

Neodvisnostni polinom dreves ni vedno logaritemsko konkaven, začenši z redom 26

article en

Abstract

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

Repository of the University of Primorsk (University of Primorska)
Openalex Percentile: Top 30%
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Neodvisnostni polinom dreves ni vedno logaritemsko konkaven, začenši z redom 26 · Repository of the University of Primorsk (University of Primorska) (2025) | TGRS Research Map | TGRS