Results 41 to 50 of about 63,637 (247)
CONSTRUCTION OF BICYCLIC GRAPH AND ITS APPLICATION IN TRANS JOGJA ROUTES
Barekeng, 2023 A bicyclic graph is a type of graph that consists of exactly two cycles. A cycle is a graph that is a closed path where no vertices are repeated except the first and last vertices which are the same.
Aditya Ambarwati, Vira Hari Krisnawati
doaj +1 more source
The line completion number of hypercubes
AKCE International Journal of Graphs and Combinatorics, 2019 In 1992, Bagga, Beineke, and Varma introduced the concept of the super line graph of index of a graph denoted by The vertices of are the -subsets of and two vertices and are adjacent if there exist and such that and are adjacent edges in They also ...
S.A. Tapadia, B.N. Waphare
doaj +1 more source
The complete list of Ramsey $(2K_2,K_4)$-minimal graphs
Electronic Journal of Graph Theory and Applications, 2015 Let $F, G,$ and $H$ be non-empty graphs. The notation $F \rightarrow (G,H)$ means that if all edges of $F$ are arbitrarily colored by red or blue, then either the subgraph of $F$ induced by all red edges contains a graph $G$ or the subgraph of $F ...
Kristiana Wijaya +3 more
doaj +1 more source
Edge erasures and chordal graphs
Electronic Journal of Graph Theory and Applications, 2021 We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph.
Jared Culbertson +2 more
doaj +1 more source
On the existence of total dominating subgraphs with a prescribed additive hereditary property [PDF]
, 2011 Recently, Bacsó and Tuza gave a full characterization of the graphs for which every connected induced subgraph has a connected dominating subgraph satisfying an arbitrary prescribed hereditary property.
Schaudt, Oliver
core +1 more source
Domination properties and induced subgraphs
Discrete Mathematics, 1993 AbstractLet the class Forb(Ct, Pt) consist of all graphs containing no induced cycle or path on t vertices, and denote by Dom(d, k) the class of graphs in which every connected induced subgraph H has a k-dominating subgraph D of diameter at most d (i.e.
Zs. Tuza, Gábor Bacsó
openaire +2 more sources
A ramsey-type theorem for multiple disjoint copies of induced subgraphs
Discussiones Mathematicae Graph Theory, 2014 Let k and ℓ be positive integers with ℓ ≤ k − 2. It is proved that there exists a positive integer c depending on k and ℓ such that every graph of order (2k−1−ℓ/k)n+c contains n vertex disjoint induced subgraphs, where these subgraphs are isomorphic to ...
Nakamigawa Tomoki
doaj +1 more source
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph
, 2014 In this paper, we address the problem of enumerating all induced subtrees in an input k-degenerate graph, where an induced subtree is an acyclic and connected induced subgraph.
A Shioura +7 more
core +1 more source
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
Application of an Extremal Result of Erdős and Gallai to the (n,k,t) Problem
Theory and Applications of Graphs, 2017 An extremal result about vertex covers, attributed by Hajnal to Erdős and Gallai, is applied to prove the following: If n, k, and t are integers satisfying n ≥ k ≥ t ≥ 3 and k ≤ 2t - 2, and G is a graph with the minimum number of edges among graphs on n ...
Matt Noble +3 more
doaj +1 more source