q)$ hypergraph
در نشریات گروه ریاضی-
Journal of Algebraic Structures and Their Applications, Volume:11 Issue: 4, Autumn 2024, PP 311 -319
Recent studies have shown that hypergraphs are useful in solving real-life problems. Hypergraphs have been successfully applied in various fields. Inspiring by the importance, we shall introduce a new hypergraph assigned to a given module. By the way, vertices of this hypergraph (which we call sum hypergraph) are all nontrivial submodules of a module $P$ and a subset $E$ of the vertices is a hyperedge in case the sum of each two elements of $E$ is equal to $P$ and $E$ is maximal with respect to this condition. Some general properties of such hypergraphs are discussed. Semisimple modules with length $2$ are characterized by their corresponding sum hypergraphs. It is shown that the sum hypergraph assigned to a finite module $P$ is connected if and only if $P$ is semisimple.
Keywords: Hyperedge, Hypergraph, Semisimple Module, Simple Submodule, Small Submodule -
A hypertree is a special type of connected hypergraph that removes any, its hyperedge then results in a disconnected hypergraph. Relation between hypertrees (hypergraphs) and trees (graphs) can be helpful to solve real problems in hypernetworks and networks and it is the main tool in this regard. The purpose of this paper is to introduce a positive relation (as $\alpha$-relation) on hypertrees that makes a connection between hypertrees and trees. This relation is dependent on some parameters such as path, length of a path, and the intersection of hyperedges. For any $q\in \mathbb{N}, $ we introduce the concepts of a derivable tree, $(\alpha, q)$-hypergraph, and fundamental $(\alpha, q)$-hypertree for the first time in this study and analyze the structures of derivable trees from hypertrees via given positive relation. In the final, we apply the notions of derivable trees, $(\alpha, q)$-trees in real optimization problems by modeling hypernetworks and networks based on hypertrees and trees, respectively.Keywords: $, alpha$-Relation, Fundamental $(, alpha, q)$-hypergraph, $k$-Parts
-
A t-Cayley hypergraph X = t-Cay(G; S) is called normal for a finite group G, if the right regular representation ) of G is normal in the full automorphism group Aut(X) of X. In this paper, we investigate the normality of t-Cayley hypergraphs of abelian groups, where S < 4Keywords: hypergraph, t-Cayley hypergraph, normal t-Cayley hypergraph
- نتایج بر اساس تاریخ انتشار مرتب شدهاند.
- کلیدواژه مورد نظر شما تنها در فیلد کلیدواژگان مقالات جستجو شدهاست. به منظور حذف نتایج غیر مرتبط، جستجو تنها در مقالات مجلاتی انجام شده که با مجله ماخذ هم موضوع هستند.
- در صورتی که میخواهید جستجو را در همه موضوعات و با شرایط دیگر تکرار کنید به صفحه جستجوی پیشرفته مجلات مراجعه کنید.