Consider G(E,V) be a finite, undirected and simple connected graph. This paper includes study of some properties that illustrate the relations between three numbers in a graph which are chromatic, domination, and independence with special restrictions. Finally, we compute these parameters in a new graph namely K4 -isosceles triangular graph.

We provide a link between topological graph theory and pseudoline arrangements from the theory of oriented matroids. We investigate and generalize a function f that assigns to each simple pseudoline arrangement with an even number of elements a pair of complete-graph embeddings on a surface. Each element of the pair keeps the information of the oriented matroid we started with. We call a simple...

For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In [J. Graph Theory, 11 (1987), 399-407], Broersma and Veldman proposed an open problem: For a given positive integer k, determine the value s for which the statement Let G be a k-triangular graph. Then L(G), the line graph of G, is s-hamiltonian if and only L(G) is (s + 2)-connected is...

In 1891, Peterson [6] proved that every 3-regular bridge-less graph has a perfect matching. It is well known that the dual of a triangular mesh on a compact manifold is a 3-regular graph. M. Gopi and D. Eppstein [4] use Peterson’s theorem to solve the problem of constructing strips of triangles from triangular meshes on a compact manifold. P. Diaz-Gutierrez and M. Gopi [3] elaborate on the crea...

In this work, simulations with scalene triangle meshes represented by a recently proposed graphbased adaptive mesh refinement technique are described. Previously, simulations exclusively with isosceles right triangles were presented with this graph-based scheme. This data structure represents triangular meshes in finite-volume discretizations in order to solve second-order partial differential ...

In this paper we present an approximation algorithm for solving the following optimal motion planning problem: Given a planar space composed of triangular regions , each of which is associated with a positive unit weight, and two points s and t, nd a path from s to t with the minimum weight, where the weight of a path is deened to be the weighted sum of the lengths of the sub-paths within each ...

The structure of graded triangular algebras T of arbitrary dimension are studied in this paper. This is motivated in part for the important role that triangular algebras play in the study of oriented graphs, upper triangular matrix algebras or nest algebras. It is shown that T decomposes as T = U + ( ∑ i∈I Ti), where U is an R-submodule contained in the 0-homogeneous component and any Ti a well...

A graph G= (V,E) with p vertices and q edges is called a Harmonic mean graph if it is possible to label the vertices xV with distinct labels f(x) from 1,2,....,q+1 in such a way that when each edge e=uv is labeled with f(uv)= ( ) ( ) ( ) ( ) (or) ( ) ( ) ( ) ( ) , then the edge labels are distinct. In this case, f is called Harmonic mean labeling of G. In this paper we prove that Double Triang...