Results 51 to 60 of about 652,005 (320)
On Split $$B_1$$-EPG Graphs [PDF]
, 2018 In this paper, we are interested in edge intersection graphs of paths in a grid, such that each such path has at most one bend. These graphs were introduced in [12] and they are called \(B_1\)-EPG graphs. In particular, we focus on split graphs and characterise those that are \(B_1\)-EPG.
Zakir Deniz +3 more
openaire +2 more sources
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 The families EPT (resp. EPG) Edge Intersection Graphs of Paths in a tree (resp. in a grid) are well studied graph classes. Recently we introduced the graph classes Edge-Intersecting and Non-Splitting Paths in a Tree ENPT, and in a Grid (ENPG).
Arman Boyacı +3 more
doaj +1 more source
On some Graphs with a Unique Perfect Matching
, 2017 We show that deciding whether a given graph $G$ of size $m$ has a unique perfect matching as well as finding that matching, if it exists, can be done in time $O(m)$ if $G$ is either a cograph, or a split graph, or an interval graph, or claw-free ...
Chaplick, S. +3 more
core +1 more source
SPECTRA OF GRAPH OPERATIONS BASED ON SPLITTING GRAPH
Journal of Applied Analysis & Computation, 2023 Summary: The splitting graph \(\mathrm{SP}(G)\) of a graph \(G\) is the graph obtained from \(G\) by taking a new vertex \(u'\) for each \(u \in V(G)\) and joining \(u'\) to all vertices of \(G\) adjacent to \(u \). For a connected regular graph \(G_1\) and an arbitrary regular graph \(G_2\), we determine the adjacency (respectively, Laplacian and ...
Lu, Zhiqin, Ma, Xiaoling, Zhang, Minshao
openaire +1 more source
Multipartite Entanglement and Hypergraph states of three qubits
, 2013 Several entanglement measures are used to define equivalence classes in the set of hypergraph states of three qubits. Our classifications reveal that (i) under local unitary transformations, hypergraph states of three qubits are split into six classes ...
Bao, Yan-ru +3 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
The monadic second-order logic of graphs XVI : Canonical graph decompositions [PDF]
Logical Methods in Computer Science, 2006 This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more general result covering canonical graph decompositions like the modular ...
Bruno Courcelle
doaj +1 more source
The Caenorhabditis elegans DPF‐3 and human DPP4 have tripeptidyl peptidase activity
FEBS Letters, EarlyView.The dipeptidyl peptidase IV (DPPIV) family comprises serine proteases classically defined by their ability to remove dipeptides from the N‐termini of substrates, a feature that gave the family its name. Here, we report the discovery of a previously unrecognized tripeptidyl peptidase activity in DPPIV family members from two different species.
Aditya Trivedi, Rajani Kanth Gudipati
wiley +1 more source
Connected Tropical Subgraphs in Vertex-Colored Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A subgraph of a vertex-colored graph is said to be tropical whenever it contains each color of the graph. In this work we study the problem of finding a minimal connected tropical subgraph.
Jean-Alexandre Anglès d'Auriac +5 more
doaj +1 more source
On fractional realizations of graph degree sequences [PDF]
, 2013 We introduce fractional realizations of a graph degree sequence and a closely associated convex polytope. Simple graph realizations correspond to a subset of the vertices of this polytope.
Barrus, Michael D.
core