13 research outputs found
On Symmetry of Independence Polynomials
An independent set in a graph is a set of pairwise non-adjacent vertices, and
alpha(G) is the size of a maximum independent set in the graph G. A matching is
a set of non-incident edges, while mu(G) is the cardinality of a maximum
matching.
If s_{k} is the number of independent sets of cardinality k in G, then
I(G;x)=s_{0}+s_{1}x+s_{2}x^{2}+...+s_{\alpha(G)}x^{\alpha(G)} is called the
independence polynomial of G (Gutman and Harary, 1983). If
, 0=< j =< alpha(G), then I(G;x) is called symmetric (or
palindromic). It is known that the graph G*2K_{1} obtained by joining each
vertex of G to two new vertices, has a symmetric independence polynomial
(Stevanovic, 1998). In this paper we show that for every graph G and for each
non-negative integer k =< mu(G), one can build a graph H, such that: G is a
subgraph of H, I(H;x) is symmetric, and I(G*2K_{1};x)=(1+x)^{k}*I(H;x).Comment: 16 pages, 13 figure
Topological indices for the antiregular graphs
We determine some classical distance-based and degree-based topo- logical indices of the connected antiregular graphs (maximally irregular graphs). More precisely, we obtain explicitly the k-Wiener index, the hyper-Wiener index, the degree distance, the Gutman index, the first, sec- ond and third Zagreb index, the reduced first and second Zagreb index, the forgotten Zagreb index, the hyper-Zagreb index, the refined Zagreb index, the Bell index, the min-deg index, the max-deg index, the symmet- ric division index, the harmonic index, the inverse sum indeg index, the M-polynomial and the Zagreb polynomial
Betweenness-selfcentric graphs
The betweenness centrality of a vertex of a graph is the portion of shortest paths between all pairs of vertices passing through that vertex. In this paper, we study properties and constructions of graphs whose vertices have the same value of betweenness centrality.Preprin
A quantitative version of Myerson regularity
In auction and mechanism design, Myerson\u27s classical regularity condition is often too weak for a quantitative analysis of performance. For instance, ratios between revenue and welfare, or sales probabilities may vanish at the boundary of Myerson regularity. This paper introduces Lambda-regularity as a quantitative measure of how regular a distribution is. Lambda-regularity includes Myerson regularity and the monotone hazard rate condition as special cases. We show that Lambda-regularity implies sharp bounds on various key quantities in auction theory, thus extending several recent findings from quantitative auction and mechanism design