Certain strict topologies on the space of regular Borel measures on locally compact groups

Let G   denote a locally compact Hausdorff group and M(G)$M(G)$ be the space of all bounded complex-valued regular Borel measures on G  . In this paper, we define two strict topologies on M(G)$M(G)$ and study various properties of these topologies such as metrizability, barrelledness and completeness. We also determine the dual space of M(G)$M(G)$ and consider various continuity properties for the convolution product on M(G)$M(G)$ under these topologies.     

A new approach to fixed point theorems on G-metric spaces

In this paper, we introduce the metric d^G$d^G$ on a G  -metric space (X,G)$(X,G)$ and use this notion to show that many contraction conditions for maps on the G  -metric space (X,G)$(X,G)$ reduce to certain contraction conditions for maps on the metric space (X,d^G)$(X,d^G)$. As applications, the proofs of many fixed point theorems for maps on the G  -metric space (X,G)$(X,G)$ may be simplified, and many fixed point theorems for maps on the G  -metric space (X,G)$(X,G)$ are direct consequences of preceding results for maps on the metric space (X,d^G)$(X,d^G)$.     

Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs

For a countable ultrahomogeneous graph G=〈G,ρ〉$\mathbb{G}=〈G,\rho 〉$ let P(G)$\mathbb{P}(\mathbb{G})$ denote the collection of sets A⊂G$A\subset G$ such that 〈A,ρ∩[A]²〉≅G$〈A,\rho \cap {[A]}^2〉\cong \mathbb{G}$. The order types of maximal chains in the poset 〈P(G)∪{∅},⊂〉$〈\mathbb{P}(\mathbb{G})\cup \{\varnothing \},\subset 〉$ are characterized as:     

Positive semidefinite zero forcing

The positive semidefinite zero forcing number _Z+(G)${\mathrm{Z}}_{+}(G)$ of a graph G was introduced in Barioli et al. (2010) [4]. We establish a variety of properties of _Z+(G)${\mathrm{Z}}_{+}(G)$: Any vertex of G   can be in a minimum positive semidefinite zero forcing set (this is not true for standard zero forcing). The graph parameters tw(G)$\mathrm{tw}(G)$ (tree-width), _Z+(G)${\mathrm{Z}}_{+}(G)$, and Z(G)$\mathrm{Z}(G)$ (standard zero forcing number) all satisfy the Graph Complement Conjecture (see Barioli et al. (2012) [3]). Graphs having extreme values of the positive semidefinite zero forcing number are characterized. The effect of various graph operations on positive semidefinite zero forcing number and connections with other graph parameters are studied.     

A sharp upper bound on the signless Laplacian spectral radius of graphs

Let G be a simple connected graph of order n   with degree sequence _d1,_d2,…,_dn$d_1,d_2,\dots ,d_n$ in non-increasing order. The signless Laplacian spectral radius ρ(Q(G))$\rho (Q(G))$ of G   is the largest eigenvalue of its signless Laplacian matrix Q(G)$Q(G)$. In this paper, we give a sharp upper bound on the signless Laplacian spectral radius ρ(Q(G))$\rho (Q(G))$ in terms of _di$d_i$, which improves and generalizes some known results.     

Generic global rigidity of body–bar frameworks

A basic geometric question is to determine when a given framework G(p)$G(\mathbf{p})$ is globally rigid in Euclidean space R^d${\mathbb{R}}^d$, where G is a finite graph and p is a configuration of points corresponding to the vertices of G  . G(p)$G(\mathbf{p})$ is globally rigid in  R^d${\mathbb{R}}^d$ if for any other configuration q for G   such that the edge lengths of G(q)$G(\mathbf{q})$ are the same as the corresponding edge lengths of G(p)$G(\mathbf{p})$, then p is congruent to q. A framework G(p)$G(\mathbf{p})$ is redundantly rigid, if it is rigid and it remains rigid after the removal of any edge of G.     

The inverse inertia problem for the complements of partial k-trees

Let F$\mathbb{F}$ be an infinite field with characteristic not equal to two. For a graph G=(V,E)$G=(V,E)$ with V={1,…,n}$V=\{1,\dots ,n\}$, let S(G;F)$S(G;\mathbb{F})$ be the set of all symmetric n×n$n\times n$ matrices A=[_ai,j]$A=[a_{i,j}]$ over F$\mathbb{F}$ with _ai,j≠0$a_{i,j}\ne 0$, i≠j$i\ne j$ if and only if ij∈E$ij\in E$. We show that if G is the complement of a partial k  -tree and m?k+2$m?k+2$, then for all nonsingular symmetric m×m$m\times m$ matrices K   over F$\mathbb{F}$, there exists an m×n$m\times n$ matrix U   such that U^TKU∈S(G;F)$U^{T}KU\in S(G;\mathbb{F})$. As a corollary we obtain that, if k+2?m?n$k+2?m?n$ and G is the complement of a partial k-tree, then for any two nonnegative integers p and q   with p+q=m$p+q=m$, there exists a matrix in S(G;R)$S(G;\mathbb{R})$ with p positive and q negative eigenvalues.     

Decomposing a graph into bistars

Bárat and the present author conjectured that, for each tree T  , there exists a natural number _kT$k_T$ such that the following holds: If G   is a _kT$k_T$-edge-connected graph such that |E(T)|$|E(T)|$ divides |E(G)|$|E(G)|$, then G has a T-decomposition, that is, a decomposition of the edge set into trees each of which is isomorphic to T  . The conjecture has been verified for infinitely many paths and for each star. In this paper we verify the conjecture for an infinite family of trees that are neither paths nor stars, namely all the bistars S(k,k+1)$S(k,k+1)$.     

On the nonexistence of a relation between σ-left-porosity and σ-right-porosity

Given an arbitrarily weak notion of left-〈f〉$〈f〉$-porosity and an arbitrarily strong notion of right-〈g〉$〈g〉$-porosity, we construct an example of closed subset of R$\mathbb{R}$ which is not σ  -left-〈f〉$〈f〉$-porous and is right-〈g〉$〈g〉$-porous. We also briefly summarize the relations between three different definitions of porosity controlled by a function; we then observe that our construction gives the example for any combination of these definitions of left-porosity and right-porosity.     

Orthogonally additive polynomials on Fourier algebras

We show that an n-homogeneous polynomial P   on the Fourier algebra A(G)$A(G)$ of a locally compact group G   can be represented in the form P(f)=〈T,fⁿ〉$P(f)=〈T,f^n〉$(f∈A(G))$(f\in A(G))$ for some T   in the group von Neumann algebra VN(G)$\mathit{VN}(G)$ of G if and only if it is orthogonally additive and completely bounded.     

On Waringʼs problem for systems of skew-symmetric forms

This paper is devoted to a problem of finding the smallest positive integer s(m,n,k)$s(m,n,k)$ such that (m+1)$(m+1)$ generic skew-symmetric (k+1)$(k+1)$-forms in (n+1)$(n+1)$ variables as linear combinations of the same s(m,n,k)$s(m,n,k)$ decomposable skew-symmetric (k+1)$(k+1)$-forms.     

Generation and random generation: From simple groups to maximal subgroups

Let G   be a finite group and let d(G)$d(G)$ be the minimal number of generators for G  . It is well known that d(G)=2$d(G)=2$ for all (non-abelian) finite simple groups. We prove that d(H)?4$d(H)?4$ for any maximal subgroup H of a finite simple group, and that this bound is best possible.     

The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs

Let R(G)$R\left(G\right)$ be the graph obtained from G$G$ by adding a new vertex corresponding to each edge of G$G$ and by joining each new vertex to the end vertices of the corresponding edge, and Q(G)$Q\left(G\right)$ be the graph obtained from G$G$ by inserting a new vertex into every edge of G$G$ and by joining by edges those pairs of these new vertices which lie on adjacent edges of G$G$. In this paper, we determine the Laplacian polynomials of R(G)$R\left(G\right)$ and Q(G)$Q\left(G\right)$ of a regular graph G$G$; on the other hand, we derive formulae and lower bounds of the Kirchhoff index of these graphs.     

On an open problem concerning total domination critical graphs

A graph G   with no isolated vertex is total domination vertex critical if for any vertex v$v$ of G   that is not adjacent to a vertex of degree one, the total domination number of G-v$G-v$ is less than the total domination number of G  . We call these graphs _γt${\gamma }_t$-critical. If such a graph G has total domination number k, we call it k  -_γt${\gamma }_t$-critical. We verify an open problem of k  -_γt${\gamma }_t$-critical graphs and obtain some results on the characterization of total domination critical graphs of order n=Δ(G)(_γt(G)-1)+1$n=\Delta (G)({\gamma }_t(G)-1)+1$.     

On the complexity of the bondage and reinforcement problems

Let G=(V,E)$G=(V,E)$ be a graph. A subset D⊆V$D\subseteq V$ is a dominating set if every vertex not in D$D$ is adjacent to a vertex in D$D$. A dominating set D$D$ is called a total dominating set if every vertex in D$D$ is adjacent to a vertex in D$D$. The domination (resp. total domination) number of G$G$ is the smallest cardinality of a dominating (resp. total dominating) set of G$G$. The bondage (resp. total bondage) number of a nonempty graph G$G$ is the smallest number of edges whose removal from G$G$ results in a graph with larger domination (resp. total domination) number of G$G$. The reinforcement (resp. total reinforcement) number of G$G$ is the smallest number of edges whose addition to G$G$ results in a graph with smaller domination (resp. total domination) number. This paper shows that the decision problems for the bondage, total bondage, reinforcement and total reinforcement numbers are all NP-hard.     

Sharp upper bounds on the distance spectral radius of a graph

Let M=(_mij)$M=(m_{ij})$ be a nonnegative irreducible n×n$n\times n$ matrix with diagonal entries 0. The largest eigenvalue of M is called the spectral radius of the matrix M  , denoted by ρ(M)$\rho (M)$. In this paper, we give two sharp upper bounds of the spectral radius of matrix M. As corollaries, we give two sharp upper bounds of the distance matrix of a graph.