In this paper, we evaluate the uniqueness of several information-theoretic measures for graphs based on so-called information functionals and compare the results with other information indices and non-information-theoretic measures such as the well-known Balaban J index. We show that, by employing an information functional based on degree-degree associations, the resulting information index out...

We consider topological indices I that are sums of f(deg(u))f(deg(v)), where {u, v} are adjacent vertices and f is a function. The Randić connectivity index or the Zagreb group index are examples for indices of this kind. In earlier work on topological indices that are sums of independent random variables, we identified the correlation between I and the edge set of the molecular graph as the ma...

We are interested in the probability that two randomly selected neighbors of a random vertex of degree (at least) k are adjacent. We evaluate this probability for a power law random intersection graph, where each vertex is prescribed a collection of attributes and two vertices are adjacent whenever they share a common attribute. We show that the probability obeys the scaling k−δ as k → +∞. Our ...

A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...

in this paper, we determine the degree distance of the complement of arbitrary mycielskian graphs. it is well known that almost all graphs have diameter two. we determine this graphical invariant for the mycielskian of graphs with diameter two.