Results 31 to 40 of about 1,312,788 (294)
Eternal domination and clique covering
Electronic Journal of Graph Theory and Applications, 2022 We study the relationship between the eternal domination number of a graph and its clique cove-ring number using both large-scale computation and analytic methods. In doing so, we answer two open questions of Klostermeyer and Mynhardt.
Gary MacGillivray +2 more
doaj +1 more source
The spectrum of optimal excess graphs for trees with up to four edges
AKCE International Journal of Graphs and Combinatorics, 2019 In 1978, Huang and Rosa solved the spectrum problem for decomposition for trees with up to eight edges. Also, the packing and covering problems were settled for trees with up to six edges by Roditty.
Danny Dyer +2 more
doaj +1 more source
On Total H-Irregularity Strength of the Disjoint Union of Graphs
Discussiones Mathematicae Graph Theory, 2020 A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and
Ashraf Faraha +5 more
doaj +1 more source
Covering Graphs: The Covering Problem Solved
Journal of Combinatorial Theory, Series A, 1998 Let \(H\) be a fixed graph with \(h\) edges such that the gcd of all degrees of \(H\) is \(d\). The authors prove that for all \(n>n_0(H)\), where \(n_0(H)\) is enormous, the \(H\)-covering number of \(K_n\) is \(\left \lceil {dn\over 2h}\left \lceil {n-1 \over d} \right\rceil \right \rceil\) except for \(d\equiv 0\pmod 2\), \(n\equiv 1 \pmod d\), \(n ...
Yair Caro, Raphael Yuster
openaire +2 more sources
Equivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets
Journal of Applied Mathematics, 2013 Covering is a widely used form of data structures. Covering-based rough set theory provides a systematic approach to this data. In this paper, graphs are connected with covering-based rough sets.
Shiping Wang +3 more
doaj +1 more source
Negative (and positive) circles in signed graphs: A problem collection
AKCE International Journal of Graphs and Combinatorics, 2018 A signed graph is a graph whose edges are labeled positive or negative. The sign of a circle (cycle, circuit) is the product of the signs of its edges. Most of the essential properties of a signed graph depend on the signs of its circles. Here I describe
Thomas Zaslavsky
doaj +1 more source
TASKS MAPPING METHOD FOR COARSE GRAIN RECONFIGURABLE SYSTEMS [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2014 This paper deals with analysis of existing approaches to tasks mapping on reconfigurable computing systems with special attention paid to mapping methods for coarse grained reconfigurable computing systems. The purpose and objectives of a new heuristic
A. S. Rumyantsev
doaj
Computing the total H-irregularity strength of edge comb product of graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 A simple undirected graph = (V Γ, EΓ) admits an H-covering if every edge in E belongs to at least one subgraph of that is isomorphic to a graph H. For any graph admitting H-covering, a total labelling β : VΓ ∪EΓ→{1, 2, …, p} is called an H-irregular ...
Wahyujati Mohamad Fahruli, Susanti Yeni
doaj +1 more source
Discrete Mathematics, 1980 AbstractLet ρ(n) denote the smallest integer with the property that any graph with n vertices can be covered by ρ(n) complete bipartite subgraphs. We prove a conjecture of J.-C. Bermond by showing ρ(n)=n+o(n1114+ϵ) for any positive ϵ.
openaire +3 more sources
Arborescences of covering graphs
Algebraic Combinatorics, 2022 An arborescence of a directed graph Γ is a spanning tree directed toward a particular vertex v . The arborescences of a graph
Chepuri, Sunita +5 more
openaire +3 more sources