| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 431005 | Journal of Discrete Algorithms | 2012 | 5 Pages |
Abstract
The astral index of a graph is defined as the smallest number of astral graphs (also known as threshold graphs) into which the graph can be decomposed, divided by the number of vertices in the graph. The astral index is a promising new graph measure for analysing the structure of graphs in applications. In this paper, we prove some theoretical results concerning astral graphs and the astral index. We reveal a connection between astral graphs and scale-free graphs. We prove that finding the exact value of the astral index is an NP-complete problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Alexei Vernitski, Artem Pyatkin,