On the Line Graph of the Complement Graph for the Ring of Gaussian Integers Modulo n

The line graph for the complement of the zero divisor graph for the ring of Gaussian integers modulo n is studied. The diameter, the radius and degree of each vertex are determined. Complete characterization of Hamiltonian, Eulerian, planer, regular, locally and locally connected is given. The chromatic number when is a power of a prime is computed. Further properties for and are also discussed.

The Optimizing Model and Its Solution for Making Train Working Graph with Computer on Separative Division of Double－Track Lines

The authoros specialize in the field of optunization and automatic programme oftrain working graph. In this peper, at frist, a mixed 0-1 integer progranimingmodel about this problem for duuble-track lines is set up, then the principle andProcess of selution are stated, with an application exaiiiple put forward.

On traceable iterated line graph and hamiltonian path index

Xiong and Liu[21]gave a characterization of the graphs G for which the n-iterated line graph L^(n)(G)is hamiltonian,for n≥2.In this paper,we study the existence of a hamiltonian path in L^(n)(G),and give a characterization of G for which L^(n)(G)has a hamiltonian path.As applications,we use this characterization to give several upper bounds on the hamiltonian path index of a graph.

PROPERTIES OF SPECTRA OF GRAPHS AND LINE GRAPHS

Let G be a simple connected graph with n vertices and m edges,L G be the line graph of G and λ 1(L G)≥λ 2(L G)≥...≥λ m(L G) be the eigenvalues of the graph L G.In this paper,the range of eigenvalues of a line graph is considered.Some sharp upper bounds and sharp lower bounds of the eigenvalues of L G are obtained.In particular,it is proved that-2cos(πn)≤λ n-1 (L G)≤n-4 and λ n(L G)=-2 if and only if G is bipartite.

P_3-factor in Line Graphs of Trees

In this paper,we give a necessary and sufficient condition for the existence of P3-factors in the line graph of a tree.Then we present an algorithm to determine whether the line graph of a tree has a P3-factor.

On the Supereulerian Index of a Graph

Two methods for determining the supereulerian index of a graph G are given. A sharp upper bound and a sharp lower bound on the supereulerian index by studying the branch bonds of G are got.

On the Cozero-Divisor Graphs of Commutative Rings

Let R be a commutative ring with non-zero identity. The cozero-divisor graph of R, denoted by , is a graph with vertices in , which is the set of all non-zero and non-unit elements of R, and two distinct vertices a and b in are adjacent if and only if and . In this paper, we investigate some combinatorial properties of the cozero-divisor graphs and such as connectivity, diameter, girth, clique numbers and planarity. We also study the cozero-divisor graphs of the direct products of two arbitrary commutative rings.

A Non-Conventional Coloring of the Edges of a Graph

Coloring the nodes of a graph is a commonly used technique to speed up clique search algorithms. Coloring the edges of the graph as a preconditioning method can also be used to speed up computations. In this paper we will show that an unconventional coloring scheme of the edges leads to an NP-complete problem when one intends to determine the optimal number of colors.

Word-Representability of Line Graphs

A graph G=(V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x ,y) is in E for each x not equal to y . The motivation to study representable graphs came from algebra, but this subject is interesting from graph theoretical, computer science, and combinatorics on words points of view. In this paper, we prove that for n greater than 3, the line graph of an n-wheel is non-representable. This not only provides a new construction of non-repre- sentable graphs, but also answers an open question on representability of the line graph of the 5-wheel, the minimal non-representable graph. Moreover, we show that for n greater than 4, the line graph of the complete graph is also non-representable. We then use these facts to prove that given a graph G which is not a cycle, a path or a claw graph, the graph obtained by taking the line graph of G k-times is guaranteed to be non-representable for k greater than 3.

Clique-transversal number of graphs whose clique-graphs are trees

Given a graph G, a subgraph C is called a clique of G if C is a complete subgraph of G maximal under inclusion and ｜C｜ ≥2. A clique-transversal set S of G is a set of vertices of G such that S meets all cliques of G. The clique-transversal number, denoted as τC（G）, is the minimum cardinality of a clique-transversal set in G. The clique-graph of G, denoted as K（G）, is the graph obtained by taking the cliques of G as vertices, and two vertices are adjacent if and only if the corresponding cliques in G have nonempty intersection. Let F be a class of graphs G such that F = {G｜ K（G） is a tree}. In this paper the graphs in F having independent clique-transversal sets are shown and thus τC（G）/｜G｜ ≤ 1/2 for all G ∈F.

The Wiener Index of an Undirected Power Graph

The undirected power graph P(Zn) of a finite group Zn is the graph with vertex set G and two distinct vertices u and v are adjacent if and only if u ≠ v and or . The Wiener index W(P(Zn)) of an undirected power graph P(Zn) is defined to be sum of distances between all unordered pair of vertices in P(Zn). Similarly, the edge-Wiener index We(P(Zn)) of P(Zn) is defined to be the sum of distances between all unordered pairs of edges in P(Zn). In this paper, we concentrate on the wiener index of a power graph , P(Zpq) and P(Zp). Firstly, we obtain new results on the wiener index and edge-wiener index of power graph P(Zn), using m,n and Euler function. Also, we obtain an equivalence between the edge-wiener index and wiener index of a power graph of Zn.

A Remark on the Characterization of Triangulated Graphs

In this study, we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This gives an alternative characterization of triangulated graphs. Our method is based on the so-called perfectly nested sequences.

Modeling and Simulation of Hydraulic Long Transmission Line by Bond Graph

This paper addresses the issue of modeling of the hydraulic long transmission line. In its base, such model is nonlinear with distributed parameters. Since general solution in closed-form for such model in time-domain is not available, certain simplifications have to be introduced. The pipeline in the paper has been divided to a cascaded network of n segments so that a model with lumped parameters could be reached. For segment modeling, a standard library of bond graphs element has been used. On the basis of models with lumped parameters, the effect of the number of segments, pipeline length and effective bulk modulus on the dynamics of long transmission line have been analyzed.

Nomogram model including LATS2 expression was constructed to predict the prognosis of advanced gastric cancer after surgery

BACKGROUND Gastric cancer is a leading cause of cancer-related deaths worldwide.Prognostic assessments are typically based on the tumor-node-metastasis(TNM)staging system,which does not account for the molecular heterogeneity of this disease.LATS2,a tumor suppressor gene involved in the Hippo signaling pathway,has been identified as a potential prognostic biomarker in gastric cancer.AIM To construct and validate a nomogram model that includes LATS2 expression to predict the survival prognosis of advanced gastric cancer patients following ra-dical surgery,and compare its predictive performance with traditional TNM staging.METHODS A retrospective analysis of 245 advanced gastric cancer patients from the Fourth Hospital of Hebei Medical University was conducted.The patients were divided into a training group(171 patients)and a validation group(74 patients)to deve-lop and test our prognostic model.The performance of the model was determined using C-indices,receiver operating characteristic curves,calibration plots,and decision curves.RESULTS The model demonstrated a high predictive accuracy with C-indices of 0.829 in the training set and 0.862 in the validation set.Area under the curve values for three-year and five-year survival prediction were significantly robust,suggesting an excellent discrimination ability.Calibration plots confirmed the high concordance between the predictions and actual survival outcomes.CONCLUSION We developed a nomogram model incorporating LATS2 expression,which significantly outperformed conven-tional TNM staging in predicting the prognosis of advanced gastric cancer patients postsurgery.This model may serve as a valuable tool for individualized patient management,allowing for more accurate stratification and im-proved clinical outcomes.Further validation in larger patient cohorts will be necessary to establish its generaliza-bility and clinical utility.

论国际科技期刊线图(line graph)的编排规范

科技期刊不仅仅应立足国内,还要走向世界。要加快国内科技期刊国际化的步伐,就必须注重国际学术期刊的编排规范。通过对科技期刊论文中必不可少的线图(line graph)的编排进行分析研究,总结了国际期刊线图的编排规范,并针对国内科技期刊的线图存在的问题提出了解决问题的方法。

THE GRAPH INDUCED BY AFFINE M-FLATS OVER FINITE FIELDS II

Let AG(n,F q) be the n-dimensional affine space over F q,where F q is a finite field with q elements.Denote by Γ (m) the graph induced by m-flats of AG(n,F q).For any two adjacent vertices E and F of Γ (m),Γ (m)(E)∩Γ (m)(F) is studied.In particular,sizes of maximal cliques in Γ (m) are determined and it is shown that Γ (m) is not edge-regular when m<n-1.

A Note on Vulnerability in Graphs of Diameter Five （ Ⅱ ）

The line persistence of a graph G, Pt （ G ） is the minimum number of lines which must be removed to increase the diameter of G. In Ref. [7] （J. Shanghai Univ., 2003,7（4）：352-357）, we gave a characterization of graphs of diameter five with ρ1 （ G ）≥2. In this paper we will show that each of the 8 special graphs Xi （ i = 1,2,3,4,5,6,7,8） listed in condition （2） of Theorem 1 in Ref. [7] can not be deleted. Therefore the results we obtained in Ref. [7] can not in general be improved.

A Note on Acyclic Edge Colouring of Star Graph Families

A proper edge colouring f of a graph G is called acyclic if there are no bichromatic cycles in the graph. The acyclic edge chromatic number or acyclic chromatic index, denoted by , is the minimum number of colours in an acyclic edge colouring of G. In this paper, we discuss the acyclic edge colouring of middle, central, total and line graphs of prime related star graph families. Also exact values of acyclic chromatic indices of such graphs are derived and some of their structural properties are discussed.

Vulnerability in Graphs of Diameter Five

The line persistence of a graph G, ρ 1 (G) is the minimum number of lines which must be removed to increase the diameter of G. In this paper we give a characterization of graphs of diameter five with ρ 1(G)≥2.

Integer Programming Model for Maximum Clique in Graph

The maximum clique or maximum independent set of graph is a classical problem in graph theory. Com- bined with Boolean algebra and integer programming, two integer programming models for maximum clique problem, which improve the old results were designed in this paper. Then, the programming model for maximum independent set is a corollary of the main results. These two models can be easily applied to computer algorithm and software, and suitable for graphs of any scale. Finally the models are presented as Lingo algorithms, verified and compared by sev- eral examples.