Results 21 to 30 of about 5,433,596 (264)
Photonics-based modular multistate digital coherent system
Российский технологический журнал, 2022 Objectives. The study aimed to develop interspecies and interclass methods for constructing coherent radio engineering systems based on a modular complementary structure.Methods.
I. V. Unchenko, A. A. Emelyanov
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
Self-complementary and self-converse oriented graphs [PDF]
, 1970 De Bruijn [I] applied his genoralization of PÓlya's fundamental theorem to provide an outline of a general method for enumerating self-complementary structures. This was used by Read [8] to carry out in detail the enumeration of self-complementary graphs
Sridharan, M.R.
core +1 more source
Balanced Fermatean quadripartitioned neutrosophic fuzzy graphs and its application [PDF]
Mathematics and Computational SciencesThis article presents and investigates the novel model of a balanced Fermatean Quadripartitioned Neutrosophic Fuzzy Graphs, based on density functions.
Divya Venkatesan +2 more
doaj +1 more source
Independent Complementary Distance Pattern Uniform Graphs [PDF]
, 2009 A graph G =(V,E) is called to be Smarandachely uniform k-graph for an integer k ≥ 1ifthereexistsM1,M2, ·· ·,Mk ⊂ V (G) such that fMi (u) ={d(u, v):v ∈ Mi} for ∀u ∈ V (G)−Mi is independent of the choice of u ∈ V (G)−Mi and integer i, 1 ≤ i ≤ k.
Koshy, Beena +3 more
core +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
Rough Neutrosophic Digraphs with Application
Axioms, 2018 A rough neutrosophic set model is a hybrid model which deals with vagueness by using the lower and upper approximation spaces. In this research paper, we apply the concept of rough neutrosophic sets to graphs. We introduce rough neutrosophic digraphs and
Sidra Sayed +3 more
doaj +1 more source
Self-complementary (Pseudo-)Split Graphs
, 2023 We are concerned with split graphs and pseudo-split graphs whose complements are isomorphic to themselves. These special subclasses of self-complementary graphs are actually the core of self-complementary graphs.
Cao, Yixin, Chen, Haowei, Wang, Shenghua
core
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
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