Results 51 to 60 of about 827 (98)
Gregarious Kite Factorization of Tensor Product of Complete Graphs
Discussiones Mathematicae Graph Theory, 2020 A kite factorization of a multipartite graph is said to be gregarious if every kite in the factorization has all its vertices in different partite sets. In this paper, we show that there exists a gregarious kite factorization of Km × Kn if and only if mn
Tamil Elakkiya A., Muthusamy A.
doaj +1 more source
The Cartesian product of graphs with loops [PDF]
, 2014 We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still holds in this context for all connected finite graphs with at least one ...
Christiaan E. Van De Woestijne +7 more
core
Arbitrarily Partitionable {2K2, C4}-Free Graphs
Discussiones Mathematicae Graph Theory, 2022 A graph G = (V, E) of order n is said to be arbitrarily partitionable if for each sequence λ = (λ1, λ2, …, λp) of positive integers with λ1 +·…·+λp = n, there exists a partition (V1, V2, …, Vp) of the vertex set V such that Vi induces a connected ...
Liu Fengxia +2 more
doaj +1 more source
Strong Tutte Type Conditions and Factors of Graphs
Discussiones Mathematicae Graph Theory, 2020 Let odd(G) denote the number of odd components of a graph G and k ≥ 2 be an integer. We give sufficient conditions using odd(G − S) for a graph G to have an even factor.
Yan Zheng, Kano Mikio
doaj +1 more source
The Spectrum Problem for the Connected Cubic Graphs of Order 10
Discussiones Mathematicae Graph Theory, 2021 We show that if G is a connected cubic graph of order 10, then there exists a G-decomposition of Kv if and only if v ≣ 1 or 10 (mod 15) except when v = 10 and G is one of 5 specific graphs.
Adams Peter +3 more
doaj +1 more source
On Edge H-Irregularity Strengths of Some Graphs
Discussiones Mathematicae Graph Theory, 2021 For a graph G an edge-covering of G is a family of subgraphs H1, H2, . . . , Ht such that each edge of E(G) belongs to at least one of the subgraphs Hi, i = 1, 2, . . . , t. In this case we say that G admits an (H1, H2, . . . , Ht)-(edge) covering.
Naeem Muhammad +4 more
doaj +1 more source
The Minimum Size of a Graph with Given Tree Connectivity
Discussiones Mathematicae Graph Theory, 2021 For a graph G = (V, E) and a set S ⊆ V of at least two vertices, an S-tree is a such subgraph T of G that is a tree with S ⊆ V (T). Two S-trees T1 and T2 are said to be internally disjoint if E(T1) ∩ E(T2) = ∅ and V (T1) ∩ V (T2) = S, and edge-disjoint ...
Sun Yuefang, Sheng Bin, Jin Zemin
doaj +1 more source
Sharp Upper Bounds on the Clar Number of Fullerene Graphs
Discussiones Mathematicae Graph Theory, 2018 The Clar number of a fullerene graph with n vertices is bounded above by ⌊n/6⌋ − 2 and this bound has been improved to ⌊n/6⌋ − 3 when n is congruent to 2 modulo 6.
Gao Yang, Zhang Heping
doaj +1 more source
Eigenvalues and Perfect Matchings [PDF]
AMS classification: 05C50, 05C70, 05E30.graph;perfect matching;Laplacian matrix;eigenvalues.
Brouwer, A.E., Haemers, W.H.
core +1 more source
On the Independence Number of Traceable 2-Connected Claw-Free Graphs
Discussiones Mathematicae Graph Theory, 2019 A well-known theorem by Chvátal-Erdőos [A note on Hamilton circuits, Discrete Math. 2 (1972) 111–135] states that if the independence number of a graph G is at most its connectivity plus one, then G is traceable.
Wang Shipeng, Xiong Liming
doaj +1 more source