The decomposition of Kv into K2×K5''''s

The decomposition of the complete graph Kv into Kr×Kc's, the products of Kr and Kc,is originated from the use of DNA library screening. In this paper, we consider the case where r=2 and c = 5, and show that such a decomposition exists if and only if v ≡ 1 (mod 25).     

Semisymmetric graphs of order 6p 2 and prime valency

In this paper, we investigate semisymmetric graphs of order 6p2 and of prime valency. First, we give a classification of the quasiprimitive permutation groups of degree dividing 3p2, and then, on the basis of the classification result, we prove that, for primes k and p, a connected graph Γ of order 6p2 and valency k is semisymmetric if and only if k = 3 and either Γ is the Gray graph, or p ≡ 1 (mod 6) and Γ is isomorphic to one known graph.     

A characterization of PM-compact Hamiltonian bipartite graphs

The perfect matching polytope of a graph G is the convex hull of the incidence vectors of all perfect matchings in G. A graph is called perfect matching compact(shortly, PM-compact), if its perfect matching polytope has diameter one. This paper gives a complete characterization of simple PM-compact Hamiltonian bipartite graphs. We first define two families of graphs, called the H2C-bipartite graphs and the H23-bipartite graphs, respectively. Then we show that, for a simple Hamiltonian bipartite graph G with |V(G)| ≥ 6, G is PM-compact if and only if G is K3,3, or G is a spanning Hamiltonian subgraph of either an H2C-bipartite graph or an H23-bipartite graph.     

Vertex-distinguishing E-total Coloring of Complete Bipartite Graph K_(7,n) when 7≤n≤95

Let G be a simple graph. A total coloring f of G is called an E-total coloring if no two adjacent vertices of G receive the same color, and no edge of G receives the same color as one of its endpoints. For an E-total coloring f of a graph G and any vertex x of G, let C(x) denote the set of colors of vertex x and of the edges incident with x, we call C(x) the color set of x. If C(u)≠ C(v) for any two different vertices u and v of V(G), then we say that f is a vertex-distinguishing E-total coloring of G or a VDET coloring of G for short. The minimum number of colors required for a VDET coloring of G is denoted by χ_(vt)~e(G) and is called the VDET chromatic number of G. The VDET coloring of complete bipartite graph K_(7,n)(7 ≤ n ≤ 95) is discussed in this paper and the VDET chromatic number of K_(7,n)(7 ≤ n ≤ 95) has been obtained.     

Least Common Multiple of Path, Star with Cartesian Product of Some Graphs

A graph G without isolated vertices is a least common multiple of two graphs H₁ and H₂ if G is a smallest graph,in terms of number of edges,such that there exists a decomposition of G into edge disjoint copies of H₁ and H₂.The collection of all least common multiples of H₁ and H₂ is denoted by LCM(H₁,H₂) and the size of a least common multiple of H₁ and H₂ is denoted by lcm(H₁...     

Normal edge-transitive Cayley graphs on non-abelian groups of order 4p, where p is a prime number

We determine all connected normal edge-transitive Cayley graphs on non-abelian groups with order 4p,where p is a prime number.As a consequence we prove if |G|=2δp,δ=0,1,2 and p prime,then Γ=Cay(G,S) is a connected normal 1/2 arc-transitive Cayley graph only if G=F4p,where S is an inverse closed generating subset of G which does not contain the identity element of G and F 4p is a group with presentation F4p = a,b|ap=b4=1,b-1ab=aλ,where λ2≡-1(mod p).     

Super s-restricted edge-connectivity of vertex-transitive graphs

Let G be a connected graph with vertex-set V(G)and edge-set E(G).A subset F of E(G)is an s-restricted edge-cut of G if G-F is disconnected and every component of G-F has at least s vertices.Letλs(G)be the minimum size of all s-restricted edge-cuts of G andξs(G)=min{|[X,V(G)\X]|:|X|=s,G[X]is connected},where[X,V(G)\X]is the set of edges with exactly one end in X.A graph G with an s-restricted edge-cut is called super s-restricted edge-connected,in short super-λs,ifλs(G)=ξs(G)and every minimum s-restricted edge-cut of G isolates one component G[X]with|X|=s.It is proved in this paper that a connected vertex-transitive graph G with degree k5 and girth g5 is super-λs for any positive integer s with s 2g or s 10 if k=g=6.     

Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable

The minimum number of colors needed to properly color the vertices and edges of a graph G is called the total chromatic number of G and denoted by χ’’ (G). It is shown that if a planar graph G has maximum degree Δ≥9, then χ’’ (G) = Δ + 1. In this paper, we prove that if G is a planar graph with maximum degree 8 and without intersecting chordal 4-cycles, then χ ’’(G) = 9.     

Competition Numbers and Phytogeny Numbers of Connected Graphs and Hypergraphs

Let D be a digraph.The competition graph of D is the graph having the same vertex set with D and having an edge joining two different vertices if and only if they have at least one common out-neighbor in D.The phylogeny graph of D is the competition graph of the digraph constructed from D by adding loops at all vertices.The competition/phylogeny number of a graph is the least number of vertices to be added to make the graph a competition/phylogeny graph of an acyclic digraph.In this paper,we show that for any integer k there is a connected graph such that its phylogeny number minus its competition number is greater than k.We get similar results for hypergraphs.     

On the spectral spread of bicyclic graphs with given girth

The spectral spread of a graph is defined to be the difference between the largest and the least eigenvalue of the adjacency matrix of the graph. A graph G is said to be bicyclic, if G is connected and |E(G)| = |V(G)|+ 1. Let B(n, g) be the set of bicyclic graphs on n vertices with girth g. In this paper some properties about the least eigenvalues of graphs are given, by which the unique graph with maximal spectral spread in B(n, g) is determined.     

The coninvolutory decomposition and its computation for a complex matrix

A complex, square matrix E is called coninvolutory if EE = I, where E denotes complex conjugate of the matrix E and I is an identity matrix. In this paper we introduce the coninvolutory decomposition of a complex matrix and investigate a Newton iteration for computing the coninvolutory factor. A simple numerical example illustrates our results.     

Full automorphism group of the generalized symplectic graph

Let Fq be a finite field of odd characteristic, m, ν the integers with 1≤m≤ν and Ka 2ν× 2ν nonsingular alternate matrix over Fq. In this paper, the generalized symplectic graph GSp2ν (q, m) relative to K over Fq is introduced. It is the graph with m-dimensional totally isotropic subspaces of the 2ν-dimensional symplectic space F(2ν)q as its vertices and two vertices P and Q are adjacent if and only if the rank of PKQT is 1 and the dimension of P ∩ Q is m-1. It is proved that the full automorphism group of the graph GSp2ν(q, m) is the projective semilinear symplectic group PΣp(2ν, q).     

本质子系满足链条件

Let S be a semigroup with zero and an S-act be a centered left S-act. This paper is devoted to the study of chain conditions on PS-acts. We prove that a PS-act having finite decomposition has ACC (DCC) on all subacts if it has ACC (DCC) on essential subacts. Moreover, a PS-act with ACC (DCC) on essential subacts has ACC (DCC) on all subacts if and only if it has finite decomposition. We characterize the structure of a PS-act and generalize some results of the Goldie dimension and semisimple S-acts.     

The K_2-groups over Finaite Commutative Rings

The present note determines the structure of the K2-group and of its subgroup over a finite commutative ring R by considering relations between R and finite commutative local ring Ri (1 < i < m), where R Ri and K2(R) = K2(Ri). We show that if charKi= p (Ki denotes the residual field of Ri), then K2(Ri) and its subgroups must be p-groups.     

Permanence of Metric Sparsification Property under Finite Decomposition Complexity

The notions of metric sparsification property and finite decomposition com- plexity are recently introduced in metric geometry to study the coarse Novikov conjecture and the stable Borel conjecture. In this paper, it is proved that a metric space X has finite decomposition complexity with respect to metric sparsification property if and only if X itself has metric sparsification property. As a consequence, the authors obtain an alterna- tive proof of a very recent result by Guentner, Tessera and Yu that all countable linear groups have the metric sparsification property and hence the operator norm localization property.     

On strong metric dimension of graphs and their complements

A vertex x in a graph G strongly resolves a pair of vertices v, w if there exists a shortest x-w path containing v or a shortest x-v path containing w in G. A set of vertices S■V(G) is a strong resolving set of G if every pair of distinct vertices of G is strongly resolved by some vertex in S. The strong metric dimension of G, denoted by sdim(G), is the minimum cardinality over all strong resolving sets of G. For a connected graph G of order n≥2, we characterize G such that sdim(G) equals 1, n-1, or n-2, respectively. We give a Nordhaus-Gaddum-type result for the strong metric dimension of a graph and its complement: for a graph G and its complement G, each of order n≥4 and connected, we show that 2≤sdim(G)+sdim(G)≤2( n-2). It is readily seen that sdim(G)+sdim(G)=2 if and only if n=4; we show that, when G is a tree or a unicyclic graph, sdim(G)+sdim(G)=2(n 2) if and only if n=5 and G ～=G ～=C5, the cycle on five vertices. For connected graphs G and G of order n≥5, we show that 3≤sdim(G)+sdim(G)≤2(n-3) if G is a tree; we also show that 4≤sdim(G)+sdim(G)≤2(n-3) if G is a unicyclic graph of order n≥6. Furthermore, we characterize graphs G satisfying sdim(G)+sdim(G)=2(n-3) when G is a tree or a unicyclic graph.     

Groups with the same order and degree pattern

The degree pattern of a finite group has been introduced in [18].A group M is called k-fold OD- characterizable if there exist exactly k non-isomorphic finite groups having the same order and degree pattern as M .In particular,a 1-fold OD-characterizable group is simply called OD-characterizable.It is shown that the alternating groups A m and A m+1 ,for m = 27,35,51,57,65,77,87,93 and 95,are OD-characterizable,while their automorphism groups are 3-fold OD-characterizable.It is also shown that the symmetric groups S m+2 ,for m = 7,13,19,23,31,37,43,47,53,61,67,73,79,83,89 and 97,are 3-fold OD-characterizable.From this,the following theorem is derived.Let m be a natural number such that m 100.Then one of the following holds: (a) if m = 10,then the alternating groups A m are OD-characterizable,while the symmetric groups S m are OD- characterizable or 3-fold OD-characterizable;(b) the alternating group A 10 is 2-fold OD-characterizable;(c) the symmetric group S 10 is 8-fold OD-characterizable.This theorem completes the study of OD-characterizability of the alternating and symmetric groups A m and S m of degree m 100.     

Distance Integral Complete Multipartite Graphs with s=5, 6

Let D(G) = (dij )n×n denote the distance matrix of a connected graph G with order n, where dij is equal to the distance between vertices vi and vj in G. A graph is called distance integral if all eigenvalues of its distance matrix are integers. In 2014, Yang and Wang gave a su?cient and necessary condition for complete r-partite graphs Kp1,p2,··· ,pr =Ka1·p1,a2·p2,··· ,as···ps to be distance integral and obtained such distance integral graphs with s = 1, 2, 3, 4. However distance integral complete multipartite graphs Ka1·p1,a2·p2,··· ,as·ps with s>4 have not been found. In this paper, we find and construct some infinite classes of these distance integral graphs Ka1·p1,a2·p2,··· ,as·ps with s = 5, 6. The problem of the existence of such distance integral graphs Ka1·p1,a2·p2,··· ,as·ps with arbitrarily large number s remains open.     

Binormal operator and *-Aluthge transformation

Let T = U｜T｜ be the polar decomposition of a bounded linear operator T on a Hilbert space. The transformation T = ｜T｜^1/2 U｜T｜^1/2 is called the Aluthge transformation and Tn means the n-th Aluthge transformation. Similarly, the transformation T（＊）=｜T＊｜^1/2 U｜T＊｜＆1/2 is called the ＊-Aluthge transformation and Tn^（＊） means the n-th ＊-Aluthge transformation. In this paper, firstly, we show that T（＊） = UV｜T^（＊）｜ is the polar decomposition of T（＊）, where ｜T｜^1/2 ｜T^＊｜^1/2 = V｜｜T｜^1/2 ｜T^＊｜^1/2｜ is the polar decomposition. Secondly, we show that T（＊） = U｜T^（＊）｜ if and only if T is binormal, i.e., [｜T｜, ｜T^＊｜]=0, where [A, B] = AB - BA for any operator A and B. Lastly, we show that Tn^（＊） is binormal for all non-negative integer n if and only if T is centered, and so on.