Regular and Maximal Graphs with Prescribed Tripartite Graph as a Star Complement

Let G be a graph of order n andμbe an adjacency eigenvalue of G with multiplicity k≥1.A star complement H forμin G is an induced subgraph of G of order n-k with no eigenvalueμ,and the subset X=V(G-H)is called a star set forμin G.The star complement provides a strong link between graph structure and linear algebra.In this paper,the authors characterize the regular graphs with K2,2,s(s≥2)as a star complement for all possible eigenvalues,the maximal graphs with K2,2,s as a star complement for the eigenvalueμ=1,and propose some questions for further research.

A NOTE ON STRONG EMBEDDINGS OF MAXIMAL PLANAR GRAPHS ON NON ORIENTABLE SURFACES

In this paper, it is shown that for every maximal planar graph G=(V,E) , a strong embedding on some non orientable surface with genus at most |V(G)|-22 is admitted such that the surface dual of G is also a planar graph. As a corollary, an interpolation theorem for strong embeddings of G on non orientable surfaces is obtained.

CHROMATIC NUMBER OF SQUARE OF MAXIMAL OUTERPLANAR GRAPHS

Let x（G^2） denote the chromatic number of the square of a maximal outerplanar graph G and Q denote a maximal outerplanar graph obtained by adding three chords y1 y3, y3y5, y5y1 to a 6-cycle y1y2…y6y1. In this paper, it is proved that △ ＋ 1 ≤ x（G^2） ≤△ ＋ 2, and x（G^2） = A ＋ 2 if and only if G is Q, where A represents the maximum degree of G.

The Complete Chromatic Number of Maximal Outerplane Graphs

Let G be a maximal outerplane graph and X0(G) the complete chromatic number of G. This paper determines exactly X0(G) for △(G)≠5 and proves 6≤X0.(G)≤7 for △(G) = 5, where △(G) is the maximum degree of vertices of G.

A STABILITY RESULT FOR TRANSLATINGSPACELIKE GRAPHS IN LORENTZ MANIFOLDS

In this paper,we investigate spacelike graphs defined over a domain Ω⊂M^(n) in the Lorentz manifold M^(n)×ℝ with the metric−ds^(2)+σ,where M^(n) is a complete Riemannian n-manifold with the metricσ,Ωhas piecewise smooth boundary,and ℝ denotes the Euclidean 1-space.We prove an interesting stability result for translating spacelike graphs in M^(n)×ℝ under a conformal transformation.

A Bitcoin Address Multi-Classification Mechanism Based on Bipartite Graph-Based Maximization Consensus

Bitcoin is widely used as the most classic electronic currency for various electronic services such as exchanges,gambling,marketplaces,and also scams such as high-yield investment projects.Identifying the services operated by a Bitcoin address can help determine the risk level of that address and build an alert model accordingly.Feature engineering can also be used to flesh out labeled addresses and to analyze the current state of Bitcoin in a small way.In this paper,we address the problem of identifying multiple classes of Bitcoin services,and for the poor classification of individual addresses that do not have significant features,we propose a Bitcoin address identification scheme based on joint multi-model prediction using the mapping relationship between addresses and entities.The innovation of the method is to(1)Extract as many valuable features as possible when an address is given to facilitate the multi-class service identification task.(2)Unlike the general supervised model approach,this paper proposes a joint prediction scheme for multiple learners based on address-entity mapping relationships.Specifically,after obtaining the overall features,the address classification and entity clustering tasks are performed separately,and the results are subjected to graph-basedmaximization consensus.The final result ismade to baseline the individual address classification results while satisfying the constraint of having similarly behaving entities as far as possible.By testing and evaluating over 26,000 Bitcoin addresses,our feature extraction method captures more useful features.In addition,the combined multi-learner model obtained results that exceeded the baseline classifier reaching an accuracy of 77.4%.

On the Characterization of Maximal Planar Graphs with a Given Signed Cycle Domination Number

Let G = （V, E） be a simple graph. A function f ： E → {＋1,-1} is called a signed cycle domination function （SCDF） of G if ∑e∈E（C） f（e） ≥ 1 for every induced cycle C of G. The signed cycle domination number of G is defined as γ′sc（G） = min{∑e∈E f（e）｜ f is an SCDF of G}. This paper will characterize all maxima] planar graphs G with order n ≥ 6 and γ′sc（G） =n.

Catalan Number and Enumeration of Maximal Outerplanar Graphs

Catalan number is an important class of combinatorial numbers. The maximal outerplanar graphs are important in graph theory. In this paper some formulas to enumerate the numbers of maximal outerplanar graphs by means of the compressing graph and group theory method are given first. Then the relationships between Catalan numbers and the numbers of labeled and unlabeled maximal outerplanar graphs are presented. The computed results verified these formulas.

OPTIMAL CONTROL PROBLEM OF PARABOLIC DIFFERENTIAL EQUATION WITH TWO POINT BOUNDARY CONDITION

This paper deals with optimal control problem of parabolic differential equation with two point boundary conditions tin the time variable). The results here extend those in [3] on optimal control of the heat equations. Moreover, the technique used in this paper is based on some smooth approximations of 'tangent cones' in the sense of Clarke and some maximal monotone operators.

Existence and Uniqueness of Renormalized Solution of Nonlinear Degenerated Elliptic Problems

In this paper, We study a general class of nonlinear degenerated elliptic problems associated with the differential inclusion β（u）-div（α（x, Du）＋F（u）） ∈ f in fΩ, where f ∈ L1 （Ω）. A vector field a（.,.） is a Carath6odory function. Using truncation techniques and the generalized monotonicity method in the functional spaces we prove the existence of renormalized solutions for general L1-data. Under an additional strict monotonicity assumption uniqueness of the renormalized solution is established.

Spectral Radius of Hamiltonian Planar Graphs and Outerplanar Graphs

The spectral radius is an important parameter of a graph related to networks. A method for estimating the spectral radius of each spanning subgraph is used to prove that the spectral radius of a Hamiltonian planar graph of order n≥4 is less than or equal to 2+3n-11 and the spectral radius of the outerplanar graph of order n≥6 is less than or equal to 22+n-5, which are improvements over previous results. A direction for further study is then suggested.

Existence of Solution for a General Class of Strongly Nonlinear Elliptic Problems Having Natural Growth Terms and L^(1)-Data

This paper is concerned with the existence of solution for a general class of strongly nonlinear elliptic problems associated with the differential inclusionβ(u)+A(u)+g(x,u,Du)■f,where A is a Leray-Lions operator from W^(1,p)_(0)(Ω)into its dual,βmaximal monotone mapping such that 0∈β(0),while g(x,s,ξ)is a nonlinear term which has a growth condition with respect toξand no growth with respect to s but it satisfies a signcondition on s.The right hand side f is assumed to belong to L^(1)(Ω).