Related papers: Operations on Fuzzy Incidence Graphs and Strong In…
Fuzzy Graph Attention Network (FGAT), which combines Fuzzy Rough Sets and Graph Attention Networks, has shown promise in tasks requiring robust graph-based learning. However, existing models struggle to effectively capture dependencies from…
The enhanced power graph of a group G is a graph with vertex set G, where two distinct vertices x and y are adjacent if and only if there exists an element w in G such that both x and y are powers of w. To obtain the proper enhanced power…
A set of vertices $S$ in a simple isolate-free graph $G$ is a semi-total dominating set of $G$ if it is a dominating set of $G$ and every vertex of $S$ is within distance 2 or less with another vertex of $S$. The semi-total domination…
For a graph $G=(V(G),E(G))$, an Italian dominating function (ID function) $f:V(G)\rightarrow\{0,1,2\}$ has the property that for every vertex $v\in V(G)$ with $f(v)=0$, either $v$ is adjacent to a vertex assigned $2$ under $f$ or $v$ is…
This work is concerned with the prime factor decomposition (PFD) of strong product graphs. A new quasi-linear time algorithm for the PFD with respect to the strong product for arbitrary, finite, connected, undirected graphs is derived.…
In this paper, we study the following problem: given a connected graph $G$, can we reduce the domination number of $G$ by at least one using $k$ edge contractions, for some fixed integer $k \geq 0$? We present positive and negative results…
Action detection and understanding provide the foundation for the generation and interaction of multimedia content. However, existing methods mainly focus on constructing complex relational inference networks, overlooking the judgment of…
A graph is well-(edge-)dominated if every minimal (edge) dominating set is minimum. A graph is equimatchable if every maximal matching is maximum. We study these concepts on strong product graphs. We fully characterize well-edge-dominated…
The power domination problem focuses on finding the optimal placement of phase measurement units (PMUs) to monitor an electrical power network. In the context of graphs, the power domination number of a graph $G$, denoted $\gamma_P(G)$, is…
The concept of generalized domination unifies well-known variants of domination-like and independence problems, such as Dominating Set, Independent Set, Perfect Code, etc. A generalized domination (also called $[\sigma,\rho]$-Dominating…
Fuzzy systems (FSs) have enjoyed wide applications in various fields, including pattern recognition, intelligent control, data mining and bioinformatics, which is attributed to the strong interpretation and learning ability. In traditional…
In this paper, we consider the connected power domination number ($\gamma_{P, c}$) of three standard graph products. The exact value for $\gamma_{P, c}(G\circ H)$ is obtained for any two non-trivial graphs $G$ and $H.$ Further, tight upper…
A set $D$ of vertices in a graph $G=(V,E)$ is a degree restricted dominating set for $G$ if each vertex $v_i$ in $D$ is dominating atmost $g(d_i)$ vertices of $V-D$, where $g$ is a function restricting the degree value $d_i$ with respect to…
Graphs are widely used to represent the relations among entities. When one owns the complete data, an entire graph can be easily built, therefore performing analysis on the graph is straightforward. However, in many scenarios, it is…
The objective of this is to develop a Fuzzy aided Application layer Semantic Intrusion Detection System (FASIDS) which works in the application layer of the network stack. FASIDS consist of semantic IDS and Fuzzy based IDS. Rule based IDS…
In the recent advancement of multimedia technologies, it becomes a major concern of detecting visual attention regions in the field of image processing. The popularity of the terminal devices in a heterogeneous environment of the multimedia…
A graph is said to be well-edge-dominated if all its minimal edge dominating sets are minimum. It is known that every well-edge-dominated graph $G$ is also equimatchable, meaning that every maximal matching in $G$ is maximum. In this paper,…
The domain of machine learning is confronted with a crucial research area known as class imbalance learning, which presents considerable hurdles in precise classification of minority classes. This issue can result in biased models where the…
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class…
Mixed Integer Optimization has been a topic of active research in past decades. It has been used to solve Statistical problems of classification and regression involving massive data. However, there is an inherent degree of vagueness…