Jul 2026· Indonesian Journal of Combinatorics· Vol 10, pp. 34· 0 citations
TL;DR
The notions of line graphs and total graphs are investigated within the settings of Directed HyperGraphs, Directed SuperHyperGraphs, Bidirected Graphs, and Multidirected Graphs.
Abstract
Hypergraphs extend classical graphs by allowing hyperedges to connect any nonempty subset of vertices, thereby capturing complex group-level relationships. Superhypergraphs advance this framework by introducing recursively nested powerset layers, enabling the representation of hierarchical and self-referential links among hyperedges. A line graph encodes the adjacencies between edges of an original graph by transforming each edge into a vertex and connecting two vertices if their corresponding edges share a common endpoint. A total graph incorporates both the vertices and edges of the original graph as its own vertices, with edges representing adjacency or incidence between these entities. Various extensions of these graph concepts exist that incorporate directional information, such as Directed Graphs, Bidirected Graphs, and Multidirected Graphs. In this paper, we investigate the notions of line graphs and total graphs within the settings of Directed HyperGraphs, Directed SuperHyperGraphs, Bidirected Graphs, and Multidirected Graphs.
Linear hypergraph set-indexers (LHSIs) associate a graph with a vertex hypergraph and an induced edge hypergraph through injective set-valuations and symmetric-difference edge labels. This study examines structural properties of graphs under LHSIs, with particular emphasis on conditions under which the associated verte...
Viji Paul, Saneesh Babu· Asian Research Journal of Ma...· 0 citations
Graphs represent pairwise relations through vertices and edges, whereas hypergraphs capture multi-way interactions by allowing each hyperedge to connect an arbitrary number of vertices. Superhypergraphs extend this representation through an iterated powerset construction, enabling nested, multi-level relations in which...
Takaaki Fujita, Ajoy Kanti Das, Arif Mehmood et al.· International Scientific Spe...· 0 citations
This work introduces anti-fuzzy hypergraphs and anti-fuzzy superhypergraphs, formulate their mathematical definitions, and establish basic well-definedness and canonical representation results that provide a unified foundation for max-based uncertainty modeling in higher-order and hierarchical network structures.
Takaaki Fujita, Ajoy Kanti Das, Suman Das et al.· Sustainable Machine Intellig...· 1 citation
In this paper, we construct a class of infinite graphs, called substitution graphs. The vertex set consists of all finite words over a finite alphabet. A directed graph is formed by adding vertical edges connecting each word to its children and horizontal edges defined recursively by two finite directed graphs G and J:...
Qing-Cheng Zeng, Cheng Zeng, Yu-Mei Xue et al.· 0 citations
A graph is beautiful if each of its induced subgraphs is the intersection graph of all maximal nonempty 1-rectangles of a binary matrix, with adjacency defined by a common cell. Beautiful graphs were introduced as a hereditary class of Berge graphs, but a complete forbidden-induced-subgraph characterization was not obt...
The notion of graph complements has been widely generalized to study diverse structural and spectral properties of graphs. In this paper, we introduce and investigate the concept of generalized color complements of graphs with respect to a prescribed vertex partition. Building on earlier work on generalized color compl...
S. Sahana, S. D'Souza, S. Nayak et al.· Discrete Mathematics, Algori...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
