Results 71 to 80 of about 2,536,304 (342)
On Pathos Semitotal and Total Block Graph of a Tree [PDF]
, 2011 The concept of pathos of a graph G was introduced by Harary [2], as a collection of minimum number of line disjoint open paths whose union is G. The path number of a graph G is the number of paths in pathos.
Muddebihal M. H.
core +1 more source
The Graph Neural Network Model
IEEE Transactions on Neural Networks, 2009 Many underlying relationships among data in several areas of science and engineering, e.g., computer vision, molecular chemistry, molecular biology, pattern recognition, and data mining, can be represented in terms of graphs.
F. Scarselli +4 more
semanticscholar +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
FEBS Letters, EarlyView.Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source
Forcing (G,D)-number of a Graph [PDF]
, 2011 By a graph G=(V,E), we mean a finite, undirected connected graph without loops and multiple ...
Nagarajan, A. +3 more
core +1 more source
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
FEBS Letters, EarlyView.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
, 2009 For standard terminology and notion in graph theory we refer the reader to Harary [7]; the non-standard will be given in this paper as and when required.
Reddy, P. Siva Kota +3 more
core +1 more source
An isoform of 14‐3‐3 protein regulates transbilayer lipid movement at the plasma membrane
FEBS Letters, EarlyView.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
Graph Homomorphism Revisited for Graph Matching [PDF]
, 2010 In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong +4 more
core
Supereulerian Graphs and the Petersen Graph
Journal of Combinatorial Theory, Series B, 1996 A graph \(G\) is called supereulerian if \(G\) has a spanning closed trail. Using a reduction technique, which was developed by the first author [A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12, No. 1, 29-45 (1988; Zbl 0659.05073)], the authors prove that any 3-edge-connected graph with at most 10 edge cuts of size 3 either ...
Paul A. Catlin, Hong-Jian Lai
openaire +4 more sources