Results 41 to 50 of about 971 (113)
On the Optimality of 3-Restricted Arc Connectivity for Digraphs and Bipartite Digraphs
Discussiones Mathematicae Graph Theory, 2022 Let D be a strong digraph. An arc subset S is a k-restricted arc cut of D if D − S has a strong component D′ with order at least k such that D\V (D′) contains a connected subdigraph with order at least k.
Zhang Yaoyao, Meng Jixiang
doaj +1 more source
Trees Whose Even-Degree Vertices Induce a Path are Antimagic
Discussiones Mathematicae Graph Theory, 2022 An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . . ., |E(G)|} such that all vertex sums are pairwise distinct, where the vertex sum at vertex v is the sum of the labels assigned to edges incident to v.
Lozano Antoni +3 more
doaj +1 more source
Sinks in Acyclic Orientations of Graphs [PDF]
, 1999 Greene and Zaslavsky proved that the number of acyclic orientations of a graph with a unique sink is, up to sign, the linear coefficient of the chromatic polynomial.
Gebhard, David D., Sagan, Bruce E.
core +3 more sources
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
Existence of Regular Nut Graphs for Degree at Most 11
Discussiones Mathematicae Graph Theory, 2020 A nut graph is a singular graph with one-dimensional kernel and corresponding eigenvector with no zero elements. The problem of determining the orders n for which d-regular nut graphs exist was recently posed by Gauci, Pisanski and Sciriha.
Fowler Patrick W. +4 more
doaj +1 more source
On q-Power Cycles in Cubic Graphs
Discussiones Mathematicae Graph Theory, 2017 In the context of a conjecture of Erdős and Gyárfás, we consider, for any q ≥ 2, the existence of q-power cycles (i.e., with length a power of q) in cubic graphs. We exhibit constructions showing that, for every q ≥ 3, there exist arbitrarily large cubic
Bensmail Julien
doaj +1 more source
A digital Jordan surface theorem with respect to a graph connectedness
Open Mathematics, 2023 After introducing a graph connectedness induced by a given set of paths of the same length, we focus on the 2-adjacency graph on the digital line Z{\mathbb{Z}} with a certain set of paths of length nn for every positive integer nn.
Šlapal Josef
doaj +1 more source
Tournaments as Feedback Arc Sets
Electronic Journal of Combinatorics, 1995 We examine the size s(n) of a smallest tournament having the arcs of an acyclic tournament on n vertices as a minimum feedback arc set. Using an integer linear programming formulation we obtain lower bounds s(n)‚ 3ni 2iblog 2nc or s(n)‚ 3ni 1iblog 2nc ...
G. Isaak
semanticscholar +1 more source
On partial sorting in restricted rounds
Acta Universitatis Sapientiae: Informatica, 2017 Let n and k be integers such that n ≥ 2 and 1 ≤ k ≤n. In this paper, we consider the problem of finding an ordered list of the k best players out of n participants by organizing a tournament of rounds of pairwise matches (comparisons).
Iványi Antal, Fogarasi Norbert
doaj +1 more source
On characteristic and permanent polynomials of a matrix
Special Matrices, 2017 There is a digraph corresponding to every square matrix over ℂ. We generate a recurrence relation using the Laplace expansion to calculate the characteristic and the permanent polynomials of a square matrix.
Singh Ranveer, Bapat R. B.
doaj +1 more source