Edge Partition of Graphs Embeddable in the Projective Plane and the Klein Bottle

In a previous paper by the author joint with Baogang XU published in Discrete Math in 2018, we show that every non-planar toroidal graph can be edge partitioned into a planar graph and an outerplanar graph. This edge partition then implies some results in thickness and outerthickness of toroidal graphs. In particular, if each planar graph has outerthickness at most $2$ (conjectured by Chartrand, Geller and Hedetniemi in 1971 and the confirmation of the conjecture was announced by Gon\c{c}alves in 2005), then the outerthickness of toroidal graphs is at most 3 which is the best possible due to $K_7$. In this paper we continue to study the edge partition for projective planar graphs and Klein bottle embeddable graphs. We show that (1) every non-planar but projective planar graph can be edge partitioned into a planar graph and a union of caterpillar trees; and (2) every non-planar Klein bottle embeddable graph can be edge partitioned into a planar graph and a subgraph of two vertex amalgamation of a caterpillar tree with a cycle with pendant edges. As consequences, the thinkness of projective planar graphs and Klein bottle embeddabe graphs are at most $2$, which are the best possible, and the outerthickness of these graphs are at most $3$.     

On Maximal Injectivity

A right R-module E over a ring R is said to be maximally injective in case for any maximal right ideal m of R, every R-homomorphism f ： m → E can be extended to an R-homomorphism f^1 ： R → E. In this paper, we first construct an example to show that maximal injectivity is a proper generalization of injectivity. Then we prove that any right R-module over a left perfect ring R is maximally injective if and only if it is injective. We also give a partial affirmative answer to Faith＇s conjecture by further investigating the property of maximally injective rings. Finally, we get an approximation to Faith＇s conjecture, which asserts that every injective right R-module over any left perfect right self-injective ring R is the injective hull of a projective submodule.     

On the maximal eccentric connectivity indices of graphs

For a connected simple graph G, the eccentricity ec(v) of a vertex v in G is the distance from v to a vertex farthest from v, and d(v) denotes the degree of a vertex v. The eccentric connectivity index of G, denoted by ξc(G), is defined as v∈V(G)d(v)ec(v). In this paper, we will determine the graphs with maximal eccentric connectivity index among the connected graphs with n vertices and m edges(n ≤ m ≤ n + 4), and propose a conjecture on the graphs with maximal eccentric connectivity index among the connected graphs with n vertices and m edges(m ≥ n + 5).     

Generalized Liouville Theorem in Nonnegatively Curved Alexandrov Spaces

In this paper, Yau＇s conjecture on harmonic functions in Riemannian manifolds is generalized to Alexandrov spaces. It is proved that the space of harmonic functions with polynomial growth of a fixed rate is finite dimensional and strong Liouville theorem holds in Alexandrov spaces with nonnegative curvature.     

A 3-color Theorem on Plane Graphs without 5-circuits

In this paper, we prove that every plane graph without 5-circuits and without triangles of distance less than 3 is 3-colorable. This improves the main result of Borodin and Raspaud [Borodin, O. V., Raspaud, A.： A sufficient condition for planar graphs to be 3-colorable. Journal of Combinatorial Theory, Ser. B, 88, 17-27 （2003）], and provides a new upper bound to their conjecture.     

Affine planar geodesic immersions with maximal codimension

This work gives a classification theorem for affine immersions with planar geodesics in the case where the codimension is maximal. Vrancken classified parallel affine immersions in this case and obtained, among others, generalized Veronese submanifolds. In this work it is shown that the immersions with planar geodesics are the same as the parallel ones in the considered case. A geometric interpretation of parallel immersions is also given： The affine immersions with pointwise planar normal sections （with respect to the equiaffine transversal bundle） are parallel. This result is verified for surfaces in R4 and for immersions with the maximal codimension.     

Nowhere-zero 15-flow in 3-edge-connected bidirected graphs

It was conjectured by Bouchet that every bidirected graph which admits a nowhere-zero κ flow will admit a nowhere-zero 6-flow. He proved that the conjecture is true when 6 is replaced by 216. Zyka improved the result with 6 replaced by 30. Xu and Zhang showed that the conjecture is true for 6-edge-connected graphs. And for 4-edge-connected graphs, Raspaud and Zhu proved it is true with 6 replaced by 4. In this paper, we show that Bouchet＇s conjecture is true with 6 replaced by 15 for 3-edge-connected graphs.     

Orderly Algorithm to Enumerate Central Groupoids and Their Graphs

A graph has the unique path property UPPn if there is a unique path of length n between any ordered pair of nodes. This paper reiterates Royle and MacKay＇s technique for constructing orderly algorithms. We wish to use this technique to enumerate all UPP2 graphs of small orders 3^2 and 4^2. We attempt to use the direct graph formalism and find that the algorithm is inefficient. We introduce a generalised problem and derive algebraic and combinatoric structures with appropriate structure. Then we are able to design an orderly algorithm to determine all UPP2 graphs of order 3^2, which runs fast enough. We hope to be able to determine the UPP2 graphs of order 4^2 in the near future.     

Gromov hyperbolicity of periodic planar graphs

The study of hyperbolic graphs is an interesting topic since the hyperbolicity of a geodesic metric space is equivalent to the hyperbolicity of a graph related to it.The main result in this paper is a very simple characterization of the hyperbolicity of a large class of periodic planar graphs.     

DOOB’S MAXIMAL INEQUALITIES FOR MARTINGALES IN VARIABLE LEBESGUE SPACE

In this paper we deal with the martingales in variable Lebesgue space over a probability space.We first prove several basic inequalities for conditional expectation operators and give several norm convergence conditions for martingales in variable Lebesgue space.The main aim of this paper is to investigate the boundedness of weak-type and strong-type Doob’s maximal operators in martingale Lebesgue space with a variable exponent.In particular,we present two kinds of weak-type Doob’s maximal inequalities and some necessary and sufficient conditions for strong-type Doob’s maximal inequalities.Finally,we provide two counterexamples to show that the strong-type inequality does not hold in general variable Lebesgue spaces with p>1.     

Bipolar neutrosophic planar graphs

Fuzzy graph theory is used for solving real-world problems in different fields, including theoretical computer science, engineering, physics, combinatorics and medical sciences. In this paper, we present conepts of bipolar neutrosophic multigraphs, bipolar neutrosophic planar graphs, bipolar neutrosophic dual graphs, and study some of their related properties. We also describe applications of bipolar neutrosophic graphs in road network and electrical connections.     

Compact n-Manifolds via(n+l)-Colored Graphs:a New Approach

We introduce a representation via(n+l)-colored graphs of compact n-manifolds with(possibly empty)boundary,which appears to be very convenient for computer aided study and tabulation.Our construction is a generalization to arbitrary dimension of the one recently given by Cristofori and Mulazzani in dimension three,and it is dual to the one given by Pezzana in the 1970s.In this context we establish some results concerning the topology of the represented manifolds:suspensions,fundamental groups,connected sums and moves between graphs representing the same manifold.Classification results of compact orientable 4-manifolds representable by graphs up to six vertices are obtained,together with some properties of the G-degree of 5-colored graphs relating this approach to tensor models theory.     

STRONG EMBEDDINGS OF PLANAR GRAPHS ON HIGHER SURFACES

In this paper, the authors discuss the upper bound for the genus of strong embeddings for 3-connected planar graphs on higher surfaces. It is shown that the problem of determining the upper bound for the strong embedding of 3-connected planar near-triangulations on higher non-orientable surfaces is NP-hard. As a corollary, a theorem of Richter, Seymour and Siran about the strong embedding of 3-connected planar graphs is generalized to orientable surface.     

Iterative convergence theorems for maximal monotone operators and relatively nonexpansive mappings

In this paper, some iterative schemes for approximating the common element of the set of zero points of maximal monotone operators and the set of fixed points of relatively nonexpansive mappings in a real uniformly smooth and uniformly convex Banach space are proposed. Some strong convergence theorems are obtained, to extend the previous work.     

D(β)-vertex-distinguishing total coloring of graphs

A new concept of the D(β)-vertex-distinguishing total coloring of graphs, i.e., the proper total coloring such that any two vertices whose distance is not larger thanβhave different color sets, where the color set of a vertex is the set composed of all colors of the vertex and the edges incident to it, is proposed in this paper. The D(2)-vertex-distinguishing total colorings of some special graphs are discussed, meanwhile, a conjecture and an open problem are presented.     

双圈图的Laplace谱跨度

The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph. In our recent work, we have determined the graphs with maximal Laplacian spreads among all trees of fixed order and among all unicyclic graphs of fixed order, respectively. In this paper, we continue the work on Laplacian spread of graphs, and prove that there exist exactly two bicyclic graphs with maximal Laplacian spread among all bicyclic graphs of fixed order, which are obtained from a star by adding two incident edges and by adding two nonincident edges between the pendant vertices of the star, respectively.     

Unicyclic graphs of minimal spectral radius

It was conjectured by Li and Feng in 1979 that the unicyclic graph formed by a cycle of order g linking to an endvertex of a path of length k minimizes the spectral radius of all unicyclic graphs of order g + k and girth g. In 1987, Cao proved that this conjecture is true for k ≥ g(g 2)/8 and false for k = 2 and sufficiently large g. In this note, we show that g 12 suffices for the counterexample and give more counterexamples with large girth for any integer k 1.     

Persistence Approximation Property for Maximal Roe Algebras

Persistence approximation property was introduced by Hervé Oyono-Oyono and Guoliang Yu. This property provides a geometric obstruction to Baum-Connes conjecture. In this paper, the authors mainly discuss the persistence approximation property for maximal Roe algebras. They show that persistence approximation property of maximal Roe algebras follows from maximal coarse Baum-Connes conjecture. In particular, let X be a discrete metric space with bounded geometry, assume that X admits a fibred coarse embedding into Hilbert space and X is coarsely uniformly contractible, then C_(max)~*(X) has persistence approximation property. The authors also give an application of the quantitative K-theory to the maximal coarse Baum-Connes conjecture.     

CYCLE SPACES OF GRAPHS ON THE SPHERE AND THE PROJECTIVE PLANE

Cycle base theory of a graph has been well studied in abstract mathematical field such matroid theory as Whitney and Tutte did and found many applications in pratical uses such as electric circuit theory and structure analysis, etc. In this paper graph embedding theory is used to investigate cycle base structures of a 2-(edge)-connected graph on the sphere and the projective plane and it is shown that short cycles do generate the cycle spaces in the case of ““““small face-embeddings““““. As applications the authors find the exact formulae for the minimum lengthes of cycle bases of some types of graphs and present several known results. Infinite examples shows that the conditions in their main results are best possible and there are many 3-connected planar graphs whose minimum cycle bases can not be determined by the planar formulae but may be located by re-embedding them into the projective plane.     

Some Notes on Normality Criteria of Meromorphic Functions

In this paper, we study the normality of families of meromorohic functions related to a Hayman conjecture. We prove that the conditions in Hayman conjecture and in other criterions can be relaxed. The results in this paper improve some previous results.