The Gallai graph and the anti-Gallai graph of a graph G are edge disjoint spanning subgraphs of the line graph L(G). The vertices in the Gallai graph are adjacent if two of the end vertices of the corresponding edges in G coincide and the other two end vertices are nonadjacent in G. The anti-Gallai graph of G is the complement of its Gallai graph in L(G). Attributed to Gallai (1967), the study ...

An irregularity index IR(Γ) of a graph Γ is nonnegative numeric quantity (i.e., IR(Γ)≥0) such that IR(Γ)=0 iff regular graph. In this paper, we show IRC closely correlates with the normal boiling point Tbp and standard heat formation ΔHfo lower benzenoid hydrocarbons. The correlation models fit data efficiently for both are linear. We develop further mathematical properties by calculating its e...

The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r-edges of G, with two adjacent if there is an edge in one set adjacent to an edge in the other set. The line completion number lc(G) of a graph G is the least positive integer r for which Lr(G) ...

A vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors...

Graph theory has provided a very useful tool, called topological indices which are a number obtained from the graph $G$ with the property that every graph $H$ isomorphic to $G$, value of a topological index must be same for both $G$ and $H$. In this article, we present exact expressions for some topological indices of k-th subdivision graph and semi total point graphs respectively, which are a ...

The k-th semi total point graph of a graph G, , ‎is a graph‎ obtained from G by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎In this paper‎, a formula for Laplacian polynomial of in terms of‎ characteristic and Laplacian polynomials of G is computed‎, ‎where is a connected regular graph‎.The Kirchhoff index of is also computed‎.

the k-th semi total point graph of a graph g, , ‎is a graph‎ obtained from g by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎in this paper‎, a formula for laplacian polynomial of in terms of‎ characteristic and laplacian polynomials of g is computed‎, ‎where is a connected regular graph‎.the kirchhoff index of is also computed‎.

Semi-structured data has become prevalent with the growth of the Internet and other on-line information repositories. Many organizational databases are presented on the web as semi-structured data. Designing a \good" semi-structured database is increasingly crucial to prevent data redundancy, inconsistency and updating anomalies. In this paper, we deene a semi-structured schema graph and identi...