On Connected Secure Domination Polynomial of Some Graphs

Abstract: A set \( S \subseteq V(G) \) of the connected graph \( G = (V(G), E(G)) \) is said to be a connected secure dominating set if \( S \) is a dominating set, \( S \) is a secure set, and \( \langle S \rangle_G \) is a connected graph. The connected secure...

On Total Product Cordial Labeling of Some Snake Graphs

Abstract: A total product cordial labeling of a graph \( G \) is a function \( f : V \rightarrow \{0,1\} \). For each \( xy \), assign the label \( f(x)f(y) \); \( f \) is called total product cordial labeling of \( G \) if it satisfies the condition that \(...

A Study on Quasi-Interior Hyperideals in Hypersemigroups

Abstract: The Hilbert integral inequality is a well-known and widely studied result in analysis that has inspired many refinements and modifications. In this paper, we present a new logarithmic modification of this inequality. Our approach is based on a trigonometric...
Social media & sharing icons powered by UltimatelySocial