Results 31 to 40 of about 5,608,609 (280)
Certain Concepts in m-Polar Fuzzy Graph Structures
Discrete Dynamics in Nature and Society, 2016 We apply the concept of m-polar fuzzy sets to graph structures. We introduce certain concepts in m-polar fuzzy graph structures, including strong m-polar fuzzy graph structure, m-polar fuzzy Di-cycle, m-polar fuzzy Di-tree, m-polar fuzzy Di-cut vertex ...
Muhammad Akram +2 more
doaj +1 more source
自余弱弦图(On self-complementary weakly chordal graphs)
Zhejiang Daxue xuebao. Lixue ban, 2010 The class of self-complementary (sc) weakly chordal graphs is studied, which is a generalization of self-complementary chordal graphs, lower and upper bounds for the number of two-pairs in sc weakly chordal graphs have been obtained.
MERAJUDDIN() +3 more
doaj +1 more source
Correlations in totally symmetric self‐complementary plane partitions
Transactions of the London Mathematical Society, 2021 Totally symmetric self‐complementary plane partitions (TSSCPPs) are boxed plane partitions with the maximum possible symmetry. We use the well‐known representation of TSSCPPs as a dimer model on a honeycomb graph enclosed in 1/12 of a hexagon with free ...
Arvind Ayyer, Sunil Chhita
doaj +1 more source
Homomorphisms and related contractions of graphs
International Journal of Mathematics and Mathematical Sciences, 1988 For every homomorphism ϕ of a graph G there exists a contraction θϕ on G¯, the complement of G. Here we study the graph equation ϕ(G)=θϕ(G¯). In the course of our work we show that Hadwiger's Conjecture is true for every self-complementary graph.
Robert D. Girse, Richard A. Gillman
doaj +1 more source
On self-graphoidal graphs and their complements
Kuwait Journal of ScienceThe graphoidal graph G of graph H is the graph obtained by taking graphoidal cover Ψ of H as vertices and two vertices are adjacent if and only if the corresponding paths have a non-empty intersection.
Singh K.R., Pirzada S.
doaj +1 more source
Can graph-cutting improve microarray gene expression reconstructions? [PDF]
, 2008 Microarrays produce high-resolution image data that are, unfortunately, permeated with a great deal of “noise” that must be removed for precision purposes. This paper presents a technique for such a removal process. On completion of this non-trivial task,
Liu, X +4 more
core +6 more sources
Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders
International Journal of Mathematics and Mathematical Sciences, 2008 We provide a process to extend any bipartite diametrical graph of diameter 4 to an 𝑆-graph of the same diameter and partite sets. For a bipartite diametrical graph of diameter 4 and partite sets 𝑈 and 𝑊, where 2𝑚=|𝑈|≤|𝑊|, we prove that 2𝑚 is a sharp ...
Salah Al-Addasi, Hasan Al-Ezeh
doaj +1 more source
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
The H-Line Signed Graph of a Signed Graph [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required.
Reddy, Siva Kota +2 more
core +1 more source