[PDF] Top 20 On the edge energy of some specific graphs

... line graphs are found in some textbooks, for example, in ...line graphs of G are then defined recur- sively as L 2 ( G ) = L ( L ( G )) , L 3 ( G ) = L ( L 2 ( G )) , ...the energy of the line ... See full document

... As special cases of chain graphs, we can consider cactus chains. A cactus graph is a connected graph in which no edge lies in more than one cycle. Consequently, each block of a cactus graph is either an ... See full document

... We use Bondy and Murty [] for terminology and notations not defined in this paper and consider undirected and simple graphs only. Let G = (V , E) be a graph with order n. Denote by m(G, t) the number of ... See full document

... consider some class of graphs which are constructed by joining an edge to every vertex and then joining k pendent vertices to the end vertices of the edge ... See full document

... fuzzy graphs and defined different operations on ...fuzzy graphs in 2008 and discussed about the degree of a vertex in some fuzzy ...of edge degree, total edge degree and discussed ... See full document

... in graphs is of vast interest to researchers in graph theory due to its many and varied applications in fields such as optimization, linear algebra, design and analysis of communication networks, military ... See full document

... an edge product cordial labeling of graph G, if the induced vertex labeling function defined by the product of labels of incident edges to each vertex is such that the number of edges with label 0 and the number ... See full document

... and terminologies of graph theory as in [2]. A graph labeling is an assignment of integers to the vertices or edges or both, subject to certain conditions. There are several types of labeling and for a dynamic survey of ... See full document

... the edge version of some degree based topological indices such as general sum-connectivity index, Randic index, inverse sum indeg index, symmetric division deg index, augmenting Zagreb index and harmonic ... See full document

... fuzzy graphs, which are analogous to the concept corona product in crisp graph ...an edge in fuzzy graph which are obtained from two fuzzy graphs using corona product ...an edge in the corona ... See full document

... fuzzy graphs, which are analogous to the concept thorny graph in crisp graph ...Thorny graphs important plays in crisp graph ...thorny graphs [4]. Ors Yorgancıoglu and Dündar given some ... See full document

... Sequential join is a graph operation that is introduced by Harary 1181. Graphs obtained by using this operation, represent a communication network construction [2]. Consider for three or more disjoint ... See full document

... Similar to energies like Laplacian energy, distance energy, minimum covering energy, incidence energy [3,4, 5, 6, 7], the double dominating energy is defined in this paper and same is [r] ... See full document

... . Ch.Chaitanya is an Assistant professor in the Department of Mathematics in Lakireddy Bali Reddy College of Engineering (Autonomous), Mylavaram – 521 230,Krishna (DT), Andhra Pradesh, India. He received his Master’s ... See full document

... Proof: By definition, no two vertices corresponding edges in Ne(G) are adjacent and no two vertices corresponding to open edge neighborhood sets in Ne(G) are adjacent.. Thus Ne(G) h[r] ... See full document

... I n this paper, (m, k) - regular fuzzy graph and totally (m, k)-regular fuzzy graph are introduced and compared through various examples. Also, comparative study between (m, k)-regularity and totally (m, k)-regularity is ... See full document

... An edge dominating set S is a strong edge dominating set if for every edge e  E (G) - S, there is an edge f  S with deg f ≥ deg e, and e is adjacent to ...strong edge domination ... See full document

... of edge product cordial labeling of graph was introduced by Vaidya et ...an edge-labeling, with range the real numbers, such that the sum of the labels around any vertex equals some constant, ... See full document

... Abstract. For any connected graph G degree sum matrix is a matrix having sum of degrees of a pair of vertices. The degree sum energy is absolute sum of degree sum eigenvalues of G which are simply eigen values of ... See full document

... undirected graphs. The vertex set and edge set of the graph G is denoted by V(G) and E(G) ...of edge coloring is obtained from ...1)- edge coloring of stars, trees, path graphs and ... See full document