Related papers: The kth Upper Bases of Primitive Non-powerful Sign…
In this paper, we consider the local bases of primitive nonpowerful sign pattern matrices, show that there are "gaps" in the local base set and characterize some sign pattern matrices with given local bases.
We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…
In this paper, an upper bound on the nullity of signed graphs in terms of the cyclomatic number and the number of pendant vertices is proved, and the corresponding extremal signed graphs are completely characterized.
We present upper bounds on certain sums which are related to Artin's primitive root conjecture and are also used in counting ray class characters.
A k-gap is a finite k-sequence of pairwise disjoint monotone families of infinite subsets of N mixed in such a way that we cannot find a partition of N such that each family is trival on one piece of the partition. We prove that, relative…
Generalizing work on graphs, Chang and Roussel introduced $k$-power domination in hypergraphs and conjectured the upper bound for the $k$-power domination number for $r$-uniform hypergraphs on $n$ vertices was $\frac{n}{r+k}$. This upper…
The first aim of this paper is to give four types of examples of surface bundles over surfaces with non-zero signature. The first example is with base genus 2, a prescribed signature, a 0-section and the fiber genus greater than a certain…
Given a graph and an integer $k$, it is an NP-complete problem to decide whether there is a dominating set of size at most $k$. In this paper we study this problem for the Kn\"odel Graph on $n$ vertices using elementary number theory…
This article provides a reminder of some properties of primitive words and the morphisms that preserve them. Their proofs, which I have more or less revised, are included. This makes the article almost self-contained. I also contribute by…
In this paper, we study the signed domination numbers of graphs and present new sharp lower and upper bounds for this parameter. As an example, we present a lower bound on signed domination number of trees in terms of the order, leaves and…
We extend known methods to establish upper bounds on the least character non-residues contingent on different zero-free regions within the critical strip, in particular on bounded rectangles within the critical strip along the $\sigma=1$…
We investigate logarithmic and square-root types of bounds for the general difference of two primes, $P_{k+q}-P_k$, $k, q\in\mathbb{N}$.
Let G be a finite group and let k be a positive integer. We examine the relationship between structural properties of G and the number of elements of G that are not kth powers in G. In particular, we examine a bound on |G| given by Lucido…
We derive upper bounds for the eigenvalues of the Kirchhoff Laplacian on a compact metric graph depending on the graph's genus g. These bounds can be further improved if $g = 0$, i.e. if the metric graph is planar. Our results are based on…
Building upon the author's previous work on primitivity testing of finite nilpotent linear groups over fields of characteristic zero, we describe precisely those finite nilpotent groups which arise as primitive linear groups over a given…
Two previous papers, arXiv:1803.00284 and arXiv:1803.00281, introduced and studied strong subgraph $k$-connectivity of digraphs obtaining characterizations, lower and upper bounds and computational complexity results for the new digraph…
The upper and lower Nordhaus-Gaddum bounds over all graphs for the power domination number follow from known bounds on the domination number and examples. In this note we improve the upper sum bound for the power domination number…
This is a survey on upper and lower bounds for finite group actions on bounded surfaces, 3-dimensional handlebodies and closed handles, handlebodies in arbitrary dimensions and finite graphs (the common feature of these objects is that all…
The $k$-independence number of a graph $G$ is the maximum size of a set of vertices at pairwise distance greater than $k$. In this paper, for each positive integer $k$, we prove sharp upper bounds for the $k$-independence number in an…
A simple topological graph is a topological graph in which any two edges have at most one common point, which is either their common endpoint or a proper crossing. More generally, in a k-simple topological graph, every pair of edges has at…