Results 61 to 70 of about 140,780 (247)

Generation of Gray Codes Through the Rough Identity–Summand Graph of Filters of A Rough bi–Heyting Algebra

International Journal of Applied Mathematics and Computer Science
This paper introduces the concept of filters in a rough bi-Heyting algebra. The rough bi-Heyting algebra defined through the rough semiring offers interesting properties.
Praba Bashyam, Freeda Lourdusamy Packiammal Anto   +1 more
doaj   +1 more source

Nullity and Bounds to the Nullity of Dendrimer Graphs [PDF]

Al-Rafidain Journal of Computer Sciences and Mathematics, 2013
In this paper, a high zero-sum weighting is applied to evaluate the nullity of a dendrimer graph   for some special graphs such as cycles, paths, complete graphs, complete bipartite graphs and  star graphs.
Khidir Sharaf, Didar Ali
doaj   +1 more source

Detour Global Domination for Degree Splitting graphs of some graphs

Ratio Mathematica, 2023
In this paper, we introduced the new concept detour global domination number for degree splitting graph of standard graphs. The detour global dominating sets in some standard and special graphs are determined.
C. Jayasekaran, S.V. Ashwin Prakash
doaj   +1 more source

Non-vanishing of Betti numbers of edge ideals and complete bipartite subgraphs [PDF]

, 2014
Given a finite simple graph one can associate the edge ideal. In this paper we prove that a graded Betti number of the edge ideal does not vanish if the original graph contains a set of complete bipartite subgraphs with some conditions.
Kimura, Kyouko
core  

Dimer models and conformal structures

Communications on Pure and Applied Mathematics, EarlyView.
Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala, Erik Duse, István Prause, Xiao Zhong   +3 more
wiley   +1 more source

Classification of nonorientable regular embeddings of complete bipartite graphs [PDF]

, 2022
Jin Ho Kwak, Young Soo Kwon
openalex   +1 more source

Fuzzy dominator coloring on fuzzy soft graphs

Ratio Mathematica, 2023
A fuzzy soft dominator colouring of a fuzzy soft graph $G^S$(T,V) is an appropriate fuzzy soft colouring such that every single vertex of $G^S$(T,V) dominate entire vertex of a colour group.
Jahir Hussain Rasheed, Afya Farhana
doaj   +1 more source

Algoritma matching bobot maskimum dalam graph bipartit komplit berboto [PDF]

, 1998
ABSTRAK Suatu matching dalam graph G adalah subgraph 1-regular pada G yang disebabkan oleh kumpulan dart pasangan garis yang tidak adjacent. Suatu matching merupakan matching maksimum bila matching tersebut mempunyai harga pokok maksimum. Matching dalam
Astuti , Yani Parti
core  

Cocrystals and Solvates are Not the Same: A Network Perspective

ChemPhysChem, EarlyView.
Based on network analysis, cocrystals and solvates cannot be treated the same. Cocrystals and solvates are two kinds of multicomponent crystals. Cocrystals consist of solid compounds, while solvates consist of a mixture of solid and liquid compounds. This work addresses the question of whether cocrystals and solvates can be treated the same or need to ...
Tom Edward de Vries, Hugo Meekes, Elias Vlieg, René de Gelder   +3 more
wiley   +1 more source

Modularity of nearly complete graphs and bipartite graphs [PDF]

, 2023
Colin McDiarmid, Fiona Skerman
openalex   +1 more source