Results 61 to 70 of about 5,759,724 (297)
Real Quadratic-Form-Based Graph Pooling for Graph Neural Networks
Machine Learning and Knowledge Extraction, 2022 Graph neural networks (GNNs) have developed rapidly in recent years because they can work over non-Euclidean data and possess promising prediction power in many real-word applications.
Youfa Liu, Guo Chen
doaj +1 more source
Discrete Mathematics, 2009 In this paper, some results concerning the colorings of graph powers are presented. The notion of helical graphs is introduced. We show that such graphs are hom-universal with respect to high odd-girth graphs whose $(2t+1)$st power is bounded by a Kneser graph. Also, we consider the problem of existence of homomorphism to odd cycles. We prove that such
openaire +4 more sources
Average Degree in Graph Powers [PDF]
Journal of Graph Theory, 2012 AbstractThe kth power of a simple graph G, denoted by , is the graph with vertex set where two vertices are adjacent if they are within distance k in G. We are interested in finding lower bounds on the average degree of . Here we prove that if G is connected with minimum degree and , then G4 has average degree at least .
Matt DeVos +2 more
openaire +3 more sources
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
Power domination in Kn\"odel graphs and Hanoi graphs
Discussiones Mathematicae Graph Theory, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Varghese, Seethu +2 more
openaire +3 more sources
Pragmatic Graph Rewriting Modifications [PDF]
, 1999 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
Biophysical approaches for studying viral entry
FEBS Letters, EarlyView.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
SHACL-Based Validation Method of Knowledge Graph for Power System Model
Zhongguo dianli, 2022 With the expansion of the power grid and the high penetration of distributed energy resources, the power system analysis and decision-making have put forward higher requirements for comprehensive and accurate power grid models.
Xiaolu LI +5 more
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
Regularity of bicyclic graphs and their powers [PDF]
Journal of Algebra and Its Applications, 2019 Let [Formula: see text] be the edge ideal of a bicyclic graph [Formula: see text] with a dumbbell as the base graph. In this paper, we characterize the Castelnuovo–Mumford regularity of [Formula: see text] in terms of the induced matching number of [Formula: see text]. For the base case of this family of graphs, i.e.
Cid-Ruiz, Yairon +3 more
openaire +4 more sources