Sep 2026· Asian Research Journal of Mathematics· 0 citations
Abstract
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 vertex and induced edge hypergraphs are isomorphic. It is shown that a connected graph admitting such an LHSI must be unicyclic and that the cardinality of each edge in the associated hypergraphs is at most two. A construction is established for connected unicyclic graphs in which every vertex has odd degree. The study further identifies graph classes for which the lower and upper LHSI numbers coincide. In particular, for complete bipartite graphs Km,n with m, n ≥ 4, both parameters equal m + n. Exact upper LHSI numbers are also determined for cycles: IUL (C3) = 3, IUL (C4) = 6, and IUL (Cn) = 2n for n ≥ 5. The realizability of finite linear hypergraphs as vertex hypergraphs of LHSIs is also investigated. A necessary and sufficient condition is formulated in terms of a spanning subgraph of the complete graph on the hyperedge set whose symmetric-difference edge labels are distinct and themselves form a linear hypergraph. These results clarify several structural restrictions inherent in LHSI constructions.
The study of graph connectedness is a central topic in graph theory, with CF-connectedness being a specialized property of interest. A simple graph is CF-connected if it is connected and, in each of its optimal drawings, any two of its distinct vertices can be connected by a path consisting of uncrossed edges. This pap...
M. Staš, M. Švecová, Jana Fortes· Mathematics· 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...
Hypergraphs extend ordinary graphs by allowing a hyperedge to connect more than two vertices. A hypergraph is k -uniform when each hyperedge contains exactly k vertices, and it is loose cyclic when the hyperedges are arranged cyclically so that consecutive hyperedges share exactly one vertex while non-consecutive hyper...
S. Kumar N, S. P., Sujisha Manattukundayil· Journal of Advances in Mathe...· 0 citations
The existence and construction of distance magic labelings for certain families of complete bipartite graphs are investigated to contribute to the understanding of how arithmetic structure and partition properties influence the existence of distance magic labelings.
Kaveesha V. Senarathna, Sujeeva Wijesiri, S. Almeida· Symmetry· 0 citations
Covers in hypergraphs are frequently studied to capture various forms of dependence between hyperedges. For example, even covers--which check if each vertex appears in an even number of hyperedges--have found much success recently in the study of locally decodable codes. Inspired by a recently-emerging line of work on...
Joshua Brakensiek, V. Guruswami, Aaron L. Putterman· 1 citation
A graph is called H-free if the graph has no subgraph being isomorphic to H. The classical Turán problem aims to determine the maximum size of an H-free graph with given order. In 2010, Nikiforov introduced the spectral Turán-type problem: determine the maximum spectral radius of an H-free graph with given order. He al...
Xiao-Bing Luo· Mathematical and Computation...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.