The independence polynomial of a graph G is the function i(G, x) = ∑k≥0 ik xk , where ik is the number of independent sets of vertices in G of cardinality k. We prove that real roots of independence polynomials are dense in (−∞, 0], while complex roots are dense in C, even when restricting to well covered or comparability graphs. Throughout, we exploit the fact that independence polynomials are...

We give a formula for the v-number of graded ideal that can be used to compute this number. Then, we show edge I(G) graph G, induced matching number G is an upper bound when very well-covered, or has simplicial partition, well-covered connected and contains neither four, nor five cycles. In all these cases, lower regularity ring G. classify cycle vertices are shedding gain insight into family W...

Studying parallelism and concurrency in the double-pushout approach to graph transformations is mainly based on the so-called triple-pushout condition. The categories of sets and of graphs satisfy this condition. If we, however, consider graph morphisms that may change the labels in a welldefined manner (structurally labeled graphs), the triple-pushout condition does no longer hold true. In thi...

Motivated by the problem of predicting the release kinetics of matrix tablets, we study random walks on the contact graph of a random sphere packing of spheres of two sizes. For a random walk on the unweighted graph that terminates in a specified target set, we compare the euclidean distance covered to the number of steps. We find a linear dependence of the former on the latter, with proportion...

We study the minimum connected sensor cover problem (MIN-CSC) and the budgeted connected sensor cover (Budgeted-CSC) problem, both motivated by important applications (e.g., reduce the communication cost among sensors) in wireless sensor networks. In both problems, we are given a set of sensors and a set of target points in the Euclidean plane. In MIN-CSC, our goal is to find a set of sensors o...

A heterochromatic tree is an edge-colored tree in which any two edges have different colors. The heterochromatic tree partition number of an r-edge-colored graph G, denoted by tr(G), is the minimum positive integer p such that whenever the edges of the graph G are colored with r colors, the vertices of G can be covered by at most p vertex-disjoint heterochromatic trees. In this paper we determi...

The Berge-Fulkerson Conjecture states that every cubic bridgeless graph has six perfect matchings such that every edge of the graph is in exactly two of the perfect matchings. If the Berge-Fulkerson Conjecture is true, then what can we say about the proportion of edges of a cubic bridgeless graph that can be covered by k of its perfect matchings? This is the question we address in this paper. W...

Any set of vertices V ′ with {{u, v} : u ∈ V ′} (smallest or otherwise) is called a vertex cover of the graph. Intuitively, a cover is a dusting of vertices so that every edge in the graph is “covered” by some vertex, although you might also say that each edge is “hit” by some vertex. Note that vertex cover is a minimization problem, with the goal to find a vertex cover that is as small as poss...

A maximum stable set in a graph G is a stable set of maximum cardinality. S is a local maximum stable set of G, and we write S ∈ Ψ(G), if S is a maximum stable set of the subgraph induced by S ∪N(S), where N(S) is the neighborhood of S. Nemhauser and Trotter Jr. [20], proved that any S ∈ Ψ(G) is a subset of a maximum stable set of G. In [12] we have shown that the family Ψ(T ) of a forest T for...