A caterpillar graph is a tree in which the removal of all pendant vertices results in a chordless path. In this work, we determine the number of maximal independent sets (mis) in caterpillar graphs. For a general graph, this problem is #P—complete. We provide a polynomial time algorithm to generate the whole family of mis in a caterpillar graph. We also characterize the independent graph (inter...

Abstract Let be an RD‐space, namely, a space of homogeneous type in the sense Coifman and Weiss with Borel measure μ satisfying reverse doubling condition on . Based this space, authors define multilinear strongly singular Calderón–Zygmund operator whose kernel does not need any size has more singularities near diagonal than that standard operator. For such operator, we establish its boundednes...