Results 41 to 50 of about 3,384,024 (197)
Heavy subgraph pairs for traceability of block-chains
Discussiones Mathematicae Graph Theory, 2014 A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices. Let G be a graph on n vertices. We say that an induced subgraph of G is o−1-heavy if it contains two nonadjacent vertices which satisfy an Ore-type ...
Li Binlong +2 more
doaj +1 more source
Some Variations of Perfect Graphs
Discussiones Mathematicae Graph Theory, 2016 We consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) = γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k-path vertex cover number and the distance (k − 1)-domination number, respectively.
Dettlaff Magda +3 more
doaj +1 more source
Graph Classes Generated by Mycielskians
Discussiones Mathematicae Graph Theory, 2020 In this paper we use the classical notion of weak Mycielskian M′(G) of a graph G and the following sequence: M′0(G) = G, M′1(G) = M′(G), and M′n(G) = M′(M′n−1(G)), to show that if G is a complete graph of order p, then the above sequence is a generator ...
Borowiecki Mieczys law +3 more
doaj +1 more source
On Betti numbers of flag complexes with forbidden induced subgraphs [PDF]
Mathematical Proceedings of the Cambridge Philosophical Society, 2016 We analyse the asymptotic extremal growth rate of the Betti numbers of clique complexes of graphs on n vertices not containing a fixed forbidden induced subgraph H.
Karim A. Adiprasito +2 more
semanticscholar +1 more source
Theory and Applications of GraphsA class G of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by G^{apex} the class of graphs G that contain a vertex v such that G − v is in G.
Jagdeep Singh +2 more
doaj +1 more source
On Self-complementary Chordal Graphs Defined by Single Forbidden Induced Subgraph
, 2014 In this paper we deal with several subclasses of self complementary chordal graphs characterized by single forbidden induced subgraph namely Chairfree sc chordal graphs, H-free sc chordal graphs and Cross (star1, 1, 1, 2)-free sc chordal graphs.
S. Kirmani, P. Ali
semanticscholar +1 more source
Forbidden induced subgraphs for bounded p-intersection number [PDF]
Discrete Mathematics, 2015 A graph G has p -intersection number at most d if it is possible to assign to every vertex u of G , a subset S ( u ) of some ground set U with | U | = d in such a way that distinct vertices u and v of G are adjacent in G if and only if | S ( u ) ? S ( v )
C. Bornstein +3 more
semanticscholar +1 more source
Maximum induced subgraph of a recursive circulant
, 2005 The recursive circulant RC(2(n), 4) enjoys several attractive topological properties. Let max_epsilon(G) (m) denote the maximum number of edges in a subgraph of graph G induced by m nodes. In this paper, we show that max_epsilon(RC(2n,4))(m) = Sigma(i)(r)
Yang, X. +5 more
core +1 more source
Characterizing the forbidden pairs for graphs to be super-edge-connected
AKCE International Journal of Graphs and CombinatoricsLet [Formula: see text] be a set of given connected graphs. A graph G is said to be [Formula: see text]-free if G contains no H as an induced subgraph for any [Formula: see text].
Hazhe Ye, Yingzhi Tian
doaj +1 more source
Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs [PDF]
SIAM Journal on Computing, 2007 Alon et. al. [N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy, Combinatorica, 20 (2000), pp. 451-476] showed that every property that is characterized by a finite collection of forbidden induced subgraphs is $\epsilon$-testable. However, the complexity of the test is double-tower with respect to $1/\epsilon$, as the only tool known to construct ...
Noga Alon, Eldar Fischer, Ilan Newman
openaire +1 more source