Because of the well-known difficulties of exact real/mixed p computation [19, 16, 31, efficiently computable upper bound tests are of great importance for both p analysis and synthesis. However, another important issue is the introduced conservatism, and in this paper, we consider the worst case conservatism of these efficiently computable upper bound tests for real/mixed p analysis. It shown t...

In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores