2 problems

Let $G$ be a clique tree of order $n$ whose cliques are $K_{n_1},\ldots,K_{n_k}$. For a clique path $\mathbb{P}_{m_1,\ldots,m_k}$, let $\mathbb{P}_{m_1,\ldots,m_k}$ denote the grap…

Let $G\in C_8$ be a graph in the eighth subclass of the paper's partition of random Apollonian networks, and let $Q_1,Q_2,Q_3$ denote the maximal cliques relevant to the discussed…