The Setting
An edge map between finite simple graphs may identify vertices while keeping distinct ordered adjacent pairs distinct. The question is how weighted adjacency sums change when vertices inherit the weights of their images.
Let and be finite simple graphs on vertex sets and , respectively. For real vertex weights on , the vertex mass of a set and the cross edge mass of two possibly overlapping sets are the sums in (1) and (2), respectively: (1)✦ (2)✦
For real vertex weights on a finite simple graph , the unordered edge mass is the sum in (3): (3) The neighborhood of a vertex of is the set of vertices of adjacent to ; its neighborhood mass is (4). (4)✦
For a real parameter , the growth function on nonnegative arguments is (5), with denoting the natural logarithm. (5)✦ A graph with real vertex weights satisfies the cross mass bound with real constant if (6) holds for every real and sets with : (6)
An edge-injective graph projection from to is a map that sends adjacent vertices to adjacent vertices and is injective on ordered adjacent pairs.✦ The inherited weight on is the vertex weight in (7). (7)
The Claim
Theorem 1. Let be an edge-injective graph projection from to , and let be nonnegative vertex weights on , with inherited weights on . The edge mass bound is (8), and the neighborhood mass bound (9) holds for every : (8)✦ (9)✦
Suppose also that and satisfies the cross mass bound with constant . Then (10) holds for every and with : (10)✦
In the paper, the result reads: if a positive-weighted finite simple graph satisfies the cross mass bound with constant , then every finite simple graph with an edge-injective graph projection and inherited weights satisfies the same cross mass bound and, writing for unordered triangle mass, satisfies , , and for every , and these conclusions persist under finite compositions of such maps.
What Is Checked
The statements are over finite simple graphs and edge-injective graph projections with inherited nonnegative real vertex weights; the cross mass assertion also assumes a nonnegative constant and the cross mass bound on the target graph.