Results 31 to 40 of about 2,248,301 (258)
The graph grabbing game on {0,1}-weighted graphs
Results in Applied Mathematics, 2019 The graph grabbing game is a two-player game on a weighted connected graph in which two players, Alice and Bob, alternatively remove non-cut vertices one by one to gain the weights on them.
Soogang Eoh, Jihoon Choi
doaj +1 more source
Tulgeity of Line, Middle and Total Graph of Wheel Graph Families [PDF]
, 2010 Tulgeity r(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper one finds the tulgeity of line, middle and total graph of wheel graph, Gear graph and Helm ...
Vernold, Vivin +2 more
core +1 more source
Genus Distribution for a Graph [PDF]
, 2009 In this paper we develop the technique of a distribution decomposition for a graph. A formula is given to determine genus distribution of a cubic graph.
Liangxia, Wan +2 more
core +1 more source
, 2013 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
Enhancing cybersecurity through autonomous knowledge graph construction by integrating heterogeneous data sources [PDF]
PeerJ Computer ScienceCybersecurity plays a critical role in today’s modern human society, and leveraging knowledge graphs can enhance cybersecurity and privacy in the cyberspace.
Hatoon Alharbi +3 more
doaj +2 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
Derivation of Mason’s Gain Formula With a Simple Nodal Selection Strategy
IEEE AccessThe present study aims to provide a verification procedure for the classic Mason gain formula of a signal-flow graph (directed linear graph) in control system engineering using a simple nodal selection strategy.
Yao-Hsin Hwang +2 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
Using weakest application conditions to rank graph transformations for graph repair [PDF]
Logical Methods in Computer ScienceWhen using graphs and graph transformations to model systems, consistency is an important concern. While consistency has primarily been viewed as a binary property, i.e., a graph is consistent or inconsistent with respect to a set of constraints, recent ...
Lars Fritsche +4 more
doaj +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