Results 31 to 40 of about 1,324,556 (299)
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
Pragmatic Graph Rewriting Modifications [PDF]
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match ...
Rodgers, Peter +3 more
core +1 more source
Complementary vanishing graphs
Given a graph $G$ with vertices $\{v_1,\ldots,v_n\}$, we define $\mathcal{S}(G)$ to be the set of symmetric matrices $A=[a_{i,j}]$ such that for $i\ne j$ we have $a_{i,j}\ne 0$ if and only if $v_iv_j\in E(G)$. Motivated by the Graph Complement Conjecture, we say that a graph $G$ is complementary vanishing if there exist matrices $A \in \mathcal{S}(G ...
Craig Erickson +4 more
openaire +3 more sources
On self-graphoidal graphs and their complements
The 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
自余弱弦图(On self-complementary weakly chordal graphs)
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
On complementary graphs with no isolated vertices
AbstractLet G denote the complement of a graph G, and x(G), β1(G), β4(G), α0(G), α1(G) denote respectively the chromatic number, line-independence number, point-independence number, point-covering number, line-covering number of G, Nordhaus and Gaddum showed that for any graph G of order p, {2√p} ⩽ x(G) + x(G) ⩽ p + 1 and p ⩽ x(G)·x(G) ⩽ [(12(p + 1))2].
Renu C. Laskar, Bruce Auerbach
openaire +2 more sources
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz +11 more
wiley +1 more source
Complementary algorithms for graphs and percolation [PDF]
A pair of complementary algorithms are presented. One of the pair is a fast method for connecting graphs with an edge. The other is a fast method for removing edges from a graph. Both algorithms employ the same tree based graph representation and so, in concert, can arbitrarily modify any graph.
openaire +3 more sources
An isoform of 14‐3‐3 protein regulates transbilayer lipid movement at the plasma membrane
Loss of 14‐3‐3ζ in CHO cells confers resistance to exogenous phosphatidylserine (PS) and impairs endocytosis‐independent inward flip‐flop of fluorescent PS at the plasma membrane. RNAi‐mediated knockdown reproduces this defect, while no additive effect is seen in ATP11C‐deficient cells.
Akiko Yamaji‐Hasegawa +3 more
wiley +1 more source
The International Collaboration on Complementary Therapy Resources (ICCR) : working together to improve online CAM information [PDF]
Use of the Internet to find health information is increasing dramatically but the quality of information, particularly on complementary and alternative medicine (CAM) is variable.
Pinto, D. +18 more
core +1 more source

