Results 21 to 30 of about 507,111 (281)
Coverability of Graphs by Parity Regular Subgraphs
Mathematics, 2021 A graph is even (resp. odd) if all its vertex degrees are even (resp. odd). We consider edge coverings by prescribed number of even and/or odd subgraphs.
Mirko Petruševski, Riste Škrekovski
doaj +1 more source
Exact information ratios for secret sharing on small graphs with girth at least 5
Journal of Mathematical Cryptology, 2019 In a secret-sharing scheme, a piece of information – the secret – is distributed among a finite set of participants in such a way that only some predefined coalitions can recover it.
Harsányi Károly, Ligeti Péter
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 ...
Caro, Yair, Yuster, Raphael
openaire +2 more sources
Group actions and coverings of Brauer graph algebras [PDF]
, 2012 We develop a theory of group actions and coverings on Brauer graphs that parallels the theory of group actions and coverings of algebras. In particular, we show that any Brauer graph can be covered by a tower of coverings of Brauer graphs such that the ...
Green, Edward L +2 more
core +1 more source
The Average Covering Number of a Graph
Journal of Applied Mathematics, 2013 There are occasions when an average value of a graph parameter gives more useful information than the basic global value. In this paper, we introduce the concept of the average covering number of a graph (the covering number of a graph is the minimum ...
Derya Dogan, Pinar Dundar
doaj +1 more source
An algebraic formulation of the graph reconstruction conjecture [PDF]
, 2014 The graph reconstruction conjecture asserts that every finite simple graph on at least three vertices can be reconstructed up to isomorphism from its deck - the collection of its vertex-deleted subgraphs.
Bilinski +11 more
core +3 more sources
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
The Open Graph Archive: A Community-Driven Effort [PDF]
, 2011 In order to evaluate, compare, and tune graph algorithms, experiments on well designed benchmark sets have to be performed. Together with the goal of reproducibility of experimental results, this creates a demand for a public archive to gather and store ...
Bachmaier, Christian +8 more
core +4 more sources
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