Results 41 to 50 of about 1,324,556 (299)
The common minimal common neighborhood dominating signed graphs [PDF]
In this paper, we define the common minimal common neighborhooddominating signed graph (or common minimal $CN$-dominating signedgraph) of a given signed graph and offer a structuralcharacterization of common minimal $CN$-dominating signed graphs.In the ...
Kavita S Permi +2 more
doaj
On cyclically K-complementary graphs
As a generalization of the concept of self-complementary graph, the author introduces the concept of cyclically \(k\)-complementary graph. Let \(K_ n\) be complete graph of order \(n\), and \(\{H_ i:i = 1,2, \dots, k\}\) be an isomorphic factorization of \(K_ n\).
openaire +3 more sources
On separable self-complementary graphs
The authors consider simple finite undirected graphs. Their first result is a set of necessary and sufficient conditions for the complement \(\overline G\) of a separable graph \(G\) to be separable or disconnected. If \(H\) is a graph and \(P_4=v_1v_2v_3v_4\) is a 4-path, then the graph \(G\) obtained from \(H\cup P_4\) by joining \(v_2\) and \(v_3 ...
Ken-ichi Kawarabayashi +5 more
openaire +3 more sources
Biophysical approaches for studying viral entry
Viruses infect all living organisms and have been responsible for major epidemics and pandemics. Their ongoing evolutionary battle with host defenses creates a constant need for improved tools to study viral behavior. Advancing methods to probe viral attachment, fusion, and genome release deepen our understanding of how infections begin and support the
Inbar Yosibash, Raya Sorkin
wiley +1 more source
To understand the decision-making processes involved in conventional medicine and complementary medicine cancer treatment, and the role that information plays, a cross-sectional survey of cancer patients was carried out at 2 Australian cancer centres ...
Colagiuri, Ben +2 more
core +1 more source
On the structure of self-complementary graphs [PDF]
A \emph{self-complementary} graph is a graph isomorphic to its complement. An isomorphism between $G$ and its complement, viewed as a permutation of $V(G)$, is then called an \emph{antimorphism}. A \emph{skew partition} of $G$ is a partition of $V(G)$ into 4 sets $A,B,C,D$ such that there is no edge between $A,B$ and every possible edge between $C,D ...
openaire +3 more sources
Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai +4 more
wiley +1 more source
Complementary Graph Coloring [PDF]
The objective of the Graph Coloring problem is to color vertices of a graph in such a way that no two vertices that share an edge are assigned the same color.
Al-Ibrahim, Naser +3 more
core +1 more source
This work is on the nature and properties of graphs which arise in the study of centered polygonal lacunary functions. Such graphs carry both graph-theoretic properties and properties related to the so-called p-sequences found in the study of centered ...
Keith Sullivan +2 more
doaj +1 more source
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

