Results 31 to 40 of about 842 (102)
Decomposing 10-Regular Graphs into Paths of Length 5
Discussiones Mathematicae Graph Theory, 2022 Let G be a 10-regular graph which does not contain any 4-cycles. In this paper, we prove that G can be decomposed into paths of length 5, such that every vertex is a terminal of exactly two paths.
Xie Mengmeng, Zhou Chuixiang
doaj +1 more source
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
Discussiones Mathematicae Graph Theory, 2020 Let H be a graph. A decomposition of H is a set of edge-disjoint subgraphs of H whose union is H. A Hamiltonian path (respectively, cycle) of H is a path (respectively, cycle) that contains every vertex of H exactly once.
Lee Hung-Chih, Chen Zhen-Chun
doaj +1 more source
Covering the Edges of a Random Hypergraph by Cliques
Discussiones Mathematicae Graph Theory, 2022 We determine the order of magnitude of the minimum clique cover of the edges of a binomial, r-uniform, random hypergraph G(r)(n, p), p fixed. In doing so, we combine the ideas from the proofs of the graph case (r = 2) in Frieze and Reed [Covering the ...
Rödl Vojtěch, Ruciński Andrzej
doaj +1 more source
Strong edge geodetic problem in networks
Open Mathematics, 2017 Geodesic covering problems form a widely researched topic in graph theory. One such problem is geodetic problem introduced by Harary et al. [Math. Comput. Modelling, 1993, 17, 89-95].
Manuel Paul +4 more
doaj +1 more source
SIMPLE GRAPHOIDAL COVERING NUMBER OF PRODUCT OF GRAPHS
, 2016 A graphoidal cover of G is a set ψ of (not necessarily open) paths in G, such that every path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ and every edge of G is in exactly one path in ψ.
G. V. Narayanan, J. Suseela, R. Kala
semanticscholar +1 more source
Fullerene graphs have exponentially many perfect matchings
, 2009 A fullerene graph is a planar cubic 3-connected graph with only pentagonal and hexagonal faces.
D.J. Klein +17 more
core +1 more source
Fundamental Cycles and Graph Embeddings
, 2008 In this paper we present a new Good Characterization of maximum genus of a graph which makes a common generalization of the works of Xuong, Liu, and Fu et al.
B. Mohar +10 more
core +2 more sources
Packing Trees in Complete Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2022 An embedding of a graph H in a graph G is an injection (i.e., a one-to-one function) σ from the vertices of H to the vertices of G such that σ(x)σ(y) is an edge of G for all edges xy of H. The image of H in G under σ is denoted by σ(H).
Wang Jieyan
doaj +1 more source
The harmonic index for unicyclic and bicyclic graphs with given matching number
, 2015 The harmonic index of a graph G is defined as the sum of the weights 2 d.u/Cd.v/ of all edges uv of G, where d.u/ denotes the degree of a vertex u in G.
Lingping Zhong
semanticscholar +1 more source
Graceful Labeling of some Join Graphs and the Subdivision of Complete Bipartite Graphs
Journal of Applied Mathematics, Volume 2025, Issue 1, 2025.The join of graphs G and H, denoted by G + H, is the graph obtained from the disjoint union of G and H by joining each vertex in G to each vertex in H. An edge uw is said to be subdivided if uw is replaced by the path P : uvw, where v is the new vertex.
A. Panpa +3 more
wiley +1 more source