A coalition in a graph G consists of two disjoint sets of vertices and , neither of which is a dominating set but whose union is a dominating set. A coalition partition in a graph G is a vertex partition such that every set is not a dominating set but forms a coalition with another set which is not a dominating set. The coalition number equals the maximum k of a coalition partition of G. In this paper, we study the coalition number of the dth power of the n-cycle , where and . We show that for or , and also provide some bounds of for the other cases. As a special case, we obtain the exact value of the coalition number of .
Large Language Models (LLMs) have emerged as powerful tools that impact information integrity on social media platforms. This comprehensive review examines the dual role of LLMs in both facilitating and mitigating various information integrity challenges, including misinformation, disinformation, fake news, social bots, and privacy concerns. Through a systematic analysis of papers from academic databases, we identify key patterns in how LLMs influence social media ecosystems. Our findings reveal that while LLMs can enhance detection capabilities for malicious content and enable sophisticated defense mechanisms, they simultaneously pose risks by enabling the generation of highly convincing, deceptive content. We categorize and analyze the potential and challenges across different dimensions of information integrity, examining technical capabilities, ethical implications, and privacy concerns. The study demonstrates critical gaps in current approaches, particularly in cross-lingual detection, real-time monitoring, and privacy-preserving implementations. We conclude by proposing future research directions and recommendations for stakeholders to leverage LLMs while mitigating risks in social media information integrity.