4 papers
Characterization of graphs where for some graph
Zahra Rahimi, M. H. Shirdareh Haghighi, Asma Namazi
A full-homomorphism from a graph to a graph is a function on vertex sets that preserves adjacency and non-adjacency of vertices. A graph is called a minimal -obstruc…
A Study On The Graph Formulation Of Union Closed Sets Conjecture
Nived J M
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity…
Symmetric Union Closed Families
Nived J M
We demonstrate that when a graph exhibits a specific type of symmetry, it satisfies the Union Closed Conjecture(UCC). Additionally, we show that certain graph classes, such as Cyli…
Combinatorial Interpretations of -Fibonacci Numbers and Their Binomial Analogues
Nived J M
The Fibonomial coefficients are well-known analogues of the classical binomial coefficients. In 2009, Sagan and Savage introduced a combinatorial interpretation for these coefficie…