Results 111 to 120 of about 1,312,788 (294)
Covering a graph by complete bipartite graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Erdös, László Pyber
openaire +2 more sources
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss +7 more
wiley +1 more source
--supermagic labeling of graphs
A simple graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . The graph is said to be -magic if there exists a total labeling such that for every subgraph of isomorphic to , is constant. Additionally, the labeling is called
C. Chithra, G. Marimuthu, G. Kumar
doaj +1 more source
MINIMUM COVERING SEIDEL ENERGY OF A GRAPH
In this paper we have computed minimum covering Seidel energies ofa star graph, complete graph, crown graph, complete bipartite graph and cocktailparty graphs.
Mohammad Reza Farahani +2 more
core +1 more source
In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Prasad, Manjunath +3 more
core +1 more source
Importin 7 mediates the nuclear import of HIV‐1 integrase via a specific interacting interface
HIV‐1 integrase enables viral DNA integration into the host genome. By binding to the core domain of the host protein Importin 7 via its C‐terminal domain, the integrase is transported across the nuclear membrane into the nucleus, where integration of the viral genome into host DNA takes place. This translocation is a critical step for subsequent viral
Juana Bana +5 more
wiley +1 more source
We describe detailed protocols for the purification and preparation of Marchantia polymorpha Auxin Response Factor 2 (MpARF2). This protein is fused to an MBP solubility tag and an mNG fluorescent tag and is purified from Escherichia coli. The presented procedures make it possible to study MpARF2 assemblies, which could arise from phase separation ...
Bas Janssen +5 more
wiley +1 more source
On the Cover Time of Dense Graphs
We consider arbitrary graphs $G$ with $n$ vertices and minimum degree at least $δn$ where $δ>0$ is constant. If the conductance of $G$ is sufficiently large then we obtain an asymptotic expression for the cover time $C_G$ of $G$ as the solution to an explicit transcendental equation.
Colin Cooper +2 more
openaire +3 more sources
Protocol for quantifying miRNA trafficking across the endosomal membrane
An in vitro protocol measures miRNA uptake into endosomes isolated from mammalian cell extracts, which are free of subcellular contaminants. Performed at 37 °C in the presence of ATP, it ensures the import of single‐stranded miRNA into the endosomal lumen.
Syamantak Ghosh +2 more
wiley +1 more source
Bounds for graph energy in terms of vertex covering and clique numbers
Let G be a simple graph with n vertices, m edges and having adjacency eigenvalues λ1, λ2, …, λn. The energy E(G) of the graph G is defined as E(G) = ∑i = 1n∣λi∣.
Hilal A. Ganie +3 more
doaj +1 more source

