New Concepts on Quadripartitioned Bipolar Single Valued Neutrosophic Graph

The partition of indeterminacy function of the neutrosophic set into the contradiction part and the ignorance part represent the quadripartitioned single valued neutrosophic set.In this work,the new concept of quadripartitioned bipolar single valued neutrosophic graph is established,and the operations on it are studied.The Cartesian product,cross product,lexicographic product,strong product and composition of quadripartitioned bipolar single valued neutrosophic graph are investigated.The proposed concepts are illustrated with examples.

On the Lanzhou Indices of Trees under Graph Decoration

The Lanzhou index of a graph G is defined as the sum of the product between and square of du over all vertices u of G, where du and are respectively the degree of u in G and the degree of u in the complement graph of G. R(G) is obtained from G by adding a new vertex corresponding to each edge of G, then joining each new vertex to the end vertices of the corresponding edge. Lanzhou index is an important topological index. It is closely related to the forgotten index and first Zagreb index of graphs. In this note, we characterize the bound of Lanzhou index of R(T) of a tree T. And the corresponding extremal graphs are also determined.

Schrodinger Operators on Graphs and Branched Manifolds

We consider the Schrodinger operators on graphs with a finite or countable number of edges and Schr?dinger operators on branched manifolds of variable dimension. In particular, a description of self-adjoint extensions of symmetric Schr?dinger operator, initially defined on a smooth function, whose support does not contain the branch points of the graph and branch points of the manifold. These results are obtained for graphs with a single vertex, graphs with multiple vertices and graphs with a single vertex and countable set of rays.

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.

Inverse Problems for the Dirac Operator on a Star Graph

Following the previous work,we shall study some inverse problems for the Dirac operator on an equilateral star graph.It is proven that the so-called Weyl function uniquely determines the potentials.Furthermore,we pay attention to the inverse problem of recovering the potentials from the spectral data,which consists of the eigenvalues and weight matrices,and present a constructive algorithm.The basic tool in this paper is the method of spectral mappings developed by Yurko.

Research on Working out Pasenger and Goods Train Diagram with Computer Simultaneously

According to the characteristics of the railway traffic organization in China,we have studied the use of computer in making train working graph.In this paper,by analysing influences on line carrying capacities when making train working graph with two steps,we put forward a new method to work out passenger and goods train working graph simultaneously and state its principle and solution.

Inexact graph matching using a hierarchy of matching processes

Inexact graph matching algorithms have proved to be useful in many applications,such as character recognition,shape analysis,and image analysis. Inexact graph matching is,however,inherently an NP-hard problem with exponential computational complexity. Much of the previous research has focused on solving this problem using heuristics or estimations. Unfortunately,many of these techniques do not guarantee that an optimal solution will be found. It is the aim of the proposed algorithm to reduce the complexity of the inexact graph matching process,while still producing an optimal solution for a known application. This is achieved by greatly simplifying each individual matching process,and compensating for lost robustness by producing a hierarchy of matching processes. The creation of each matching process in the hierarchy is driven by an application-specific criterion that operates at the subgraph scale. To our knowledge,this problem has never before been approached in this manner. Results show that the proposed algorithm is faster than two existing methods based on graph edit operations.The proposed algorithm produces accurate results in terms of matching graphs,and shows promise for the application of shape matching. The proposed algorithm can easily be extended to produce a sub-optimal solution if required.