IJERT-Some Properties of Semigraph and its Associated Graphs (original) (raw)
Related papers
European Journal of Combinatorics, 2009
Eppstein [D. Eppstein, The lattice dimension of a graph, European J. Combin. 26 (2005) 585-592] introduced semicube graphs as the key tool for efficient computation of the lattice dimension of a graph. In this paper it is shown that, roughly speaking, every graph can be realized as the semicube graph of some partial cube. Semicube graphs of trees are studied in detail. In particular the chromatic number, the independence number and the domination number of semicube graphs of trees are determined in terms of related invariants of trees.
2012
This paper studies certain properties of set-semigraceful graphs and obtain certain bounds for the order and size of such graphs. More set-semigraceful graphs from given ones are also obtained through various graph theoretic methods.
AND n -ENERGIES OF LINEAR SEMIGRAPH
In general, graphs are associated with different types of matrices to study their structural properties. As a result, the study of spectrum of graphs become an important area of research in graph theory. Various types of energies have been discussed according to the type of matrix under consideration. In semigraphs, the adjacency between vertices is defined in many ways. This opens a broad scope to study the different energies of semigraphs. In this paper, two types of adjacency matrices, namely e-adjacency matrix and n-adjacency matrix are considered to study the respective energies of the most fundamental semigraph known as linear semigraph.
Some Results on Degree of Vertices in Semitotal-Block Graph and Total-Block Graph
International Journal of Computer Applications, 2012
We considersemitotal-block graph, total-block graph of a graph G (respectively, denoted as T b (G), T B (G)). We prove that the number of edges in a semitotal-block graph of a given graph G is equal to |E(G)| + |V(B 1)| + |V(B 2)| + … + |V(B m)|, where B 1 , B 2 , …, B m are the blocks of G. Further, we obtain that T B (G) is the ring sum of T b (G) and the block graph B(G). We introduce the concept "vertex-block graph (denoted by B v (G) of G)", andwe prove thatT b (G) is the ring sum of G and B v (G). We also present some related fundamental results along with illustrations.
Bulletin of Mathematical Sciences and Applications
In this paper the structural equivalence of union, intersection ring sum and decomposition of semigraphs are explored by using the various types of isomorphisms such as isomorphism, evisomorphism, a-isomorphism and e-isomorphism for G e , G a and G ca. We establish various types of binary operations in semigraphs.
On a graph of monogenic semigroups
Journal of Inequalities and Applications, 2013
Let us consider the finite monogenic semigroup S M with zero having elements {x, x 2 , x 3 ,. .. , x n }. There exists an undirected graph (S M) associated with S M whose vertices are the non-zero elements x, x 2 , x 3 ,. .. , x n and, f or 1 ≤ i, j ≤ n, any two distinct vertices x i and x j are adjacent if i + j > n. In this paper, the diameter, girth, maximum and minimum degrees, domination number, chromatic number, clique number, degree sequence, irregularity index and also perfectness of (S M) have been established. In fact, some of the results obtained in this section are sharper and stricter than the results presented in DeMeyer et al. (Semigroup Forum 65:206-214, 2002). Moreover, the number of triangles for this special graph has been calculated. In the final part of the paper, by considering two (not necessarily different) graphs (S 1 M) and (S 2 M), we present the spectral properties to the Cartesian product (S 1 M) (S 2 M).
INTERNATIONAL JOURNAL OF COMPUTER APPLICATION, 2017
In this paper, the well known concept of matching of graph theory has been discussed in the setting of semigraphs resulting in few new concepts like maximal vertexsaturated matching, minimal edge-saturated matching and optimum matching which have no parallels in graphs. In this connection, we record a number of characterizations of maximum matching and other related terms of semigraphs developed here and also establish parallels of theorems due to Berge and König for graphs. A new concept on total adjacent domination in connection with adjacent domination in semigraph as studied by Kamath and Bhat [7] is introduced here and few results are developed that establish links between adjacent domination number and total adjacent domination number as well as between total adjacent domination number and minimal edge-saturated matching.
Some results on semi-total signed graphs
Discussiones Mathematicae Graph Theory, 2011
A signed graph (or sigraph in short) is an ordered pair S = (S u , σ), where S u is a graph G = (V, E), called the underlying graph of S and σ : E → {+, −} is a function from the edge set E of S u into the set {+, −}, called the signature of S. The ×-line sigraph of S denoted by L × (S) is a sigraph defined on the line graph L(S u) of the graph S u by assigning to each edge ef of L(S u), the product of signs of the adjacent edges e and f in S. In this paper, first we define semi-total line sigraph and semi-total point sigraph of a given sigraph and then characterize balance and consistency of semi-total line sigraph and semi-total point sigraph.
Some properties of Square element graphs over semigroups
AKCE International Journal of Graphs and Combinatorics, 2019
The Square element graph over a semigroup S is a simple undirected graph Sq(S) whose vertex set consists precisely of all the non-zero elements of S, and two vertices a, b are adjacent if and only if either ab or ba belongs to the set {t 2 : t ∈ S} \ {1}, where 1 is the identity of the semigroup (if it exists). In this paper, we study the various properties of Sq(S). In particular, we concentrate on square element graphs over three important classes of semigroups. First, we consider the semigroup Ω n formed by the ideals of Z n. Afterwards, we consider the symmetric groups S n and the dihedral groups D n. For each type of semigroups mentioned, we look into the structural and other graph-theoretic properties of the corresponding square element graphs. c