Results 51 to 60 of about 8,313 (308)
A note on the generator subgraph of a graph
Electronic Journal of Graph Theory and Applications, 2020 Graphs considered in this paper are finite simple undirected graphs. Let G = (V(G), E(G)) be a graph with E(G) = {e1, e2,..., em}, for some positive integer m. The edge space of G, denoted by ℰ(G), is a vector space over the field ℤ2. The elements of ℰ(
Neil Mores Mame +1 more
doaj +1 more source
Forbidden subgraph pairs for traceability of block-chains
Electronic Journal of Graph Theory and Applications, 2013 A block-chain is a graph whose block graph is a path, i.e. it is either a $P_1$, a $P_2$, or a 2-connected graph, or a graph of connectivity 1 with exactly two end-blocks. A graph is called traceable if it contains a Hamilton path.
Binlong Li +2 more
doaj +1 more source
Induced subgraphs of Johnson graphs [PDF]
Involve, a Journal of Mathematics, 2012 12 pages, 4 ...
Naimi, Ramin, Shaw, Jeffrey
openaire +3 more sources
The complexity of the connected graph access structure on seven participants
Journal of Mathematical Cryptology, 2017 In this paper, we study an important problem in secret sharing that determines the exact value or bound for the complexity. First, we use the induced subgraph complexity of the graph G with access structure Γ to obtain a lower bound on the complexity of ...
Hadian Dehkordi Massoud, Safi Ali
doaj +1 more source
Induced subgraphs of prescribed size [PDF]
Journal of Graph Theory, 2003 AbstractA subgraph of a graph G is called trivial if it is either a clique or an independent set. Let q(G) denote the maximum number of vertices in a trivial subgraph of G. Motivated by an open problem of Erdős and McKay we show that every graph G on n vertices for which q(G)≤ C log n contains an induced subgraph with exactly y edges, for every y ...
Noga Alon +2 more
openaire +2 more sources
Certifying Induced Subgraphs in Large Graphs
Journal of Graph Algorithms and Applications, 2023 We introduce I/O-efficient certifying algorithms for the recognition of bipartite, split, threshold, bipartite chain, and trivially perfect graphs. When the input graph is a member of the respective class, the certifying algorithm returns a certificate that characterizes this class.Otherwise, it returns a forbidden induced subgraph as a certificate for
Ulrich Meyer 0001 +2 more
openaire +2 more sources
Advanced Intelligent Systems, EarlyView.We present a novel AI‐integrated implantation‐on‐chip platform that enables mimicking and monitoring the maternal–fetal interactions at the early phases of human embryo implantation with high spatiotemporal resolution. The complexity of the trophoblast invasion process was addressed by conducting the analysis at global (rate of invasion) and local ...
Joanna Filippi +12 more
wiley +1 more source
Electronic Notes in Discrete Mathematics, 2017 In descending generality I survey: five partial orderings of graphs, the induced-subgraph ordering, and examples like perfect, threshold, and mock threshold graphs. The emphasis is on how the induced subgraph ordering differs from other popular orderings and leads to different basic questions.
openaire +2 more sources
On maximum planar induced subgraphs
Discrete Applied Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luérbio Faria +4 more
openaire +2 more sources
On structural controllability in complex networks with periodic switching topologies
Asian Journal of Control, EarlyView.Abstract This paper investigates the structural controllability of complex networks with periodic switching topologies. First, several graph transformations that preserve structural controllability are demonstrated. Based on the n‐walk theory, a criterion is derived that determines structural controllability by analyzing only the joint graph within a ...
Jingrui Hou +3 more
wiley +1 more source