[PDF] Top 20 CHROMATIC INDEX OF SOME CLASSES OF GRAPH

... particular graph such that no adjacent edges were assigned with similar ...of graph based on its maximum degree,  , are also taken into consideration ...A graph, G is classified as class 1 ... See full document

... a graph with minimum degree at least ...dominator chromatic number of G is denoted by (G) and is defined by the minimum number of colors needed in a total dominator coloring of ...dominator chromatic ... See full document

... with classes with bounded tree-width, it has been shown that a large (although more restricted) class of graph properties can be decided in linear time on any fixed class of bounded expansion [22, ...of ... See full document

... L   i . We determine which L     n [ ] i   is Eu- lerian, Hamiltonian, regular, locally H , locally connec- ted or planer. Furthermore, the chromatic index and the edge domination number of    n ... See full document

... that graph [13, 28]. We have showed that every serial graph, ev- ery separable p-connected graph and every neighbourhood decomposable graph is ...for classes of graphs that contain very ... See full document

... A graph can be recognized by a numeric number, a polynomial, a sequence of numbers or a matrix which represents the whole graph, and these representations are aimed to be uniquely defined for that ... See full document

... conjugacy classes of these groups are then applied into graph ...conjugate graph is a graph whose the vertices are non-central elements of a finite non-Abelian ...class graph is a ... See full document

... of some standardized experiment. The Wiener index W(G) is a distance-based topological invariant is also a molecular descriptor, it much used in the study of the structure-property and the ... See full document

... harmonic index for graphs. Harmonic index is one of the most important indices in chemical and mathematical ...Randic index which is the most successful molecular descriptor in structure-property and ... See full document

... entire structure of the fuzzy graph. Based on the strength of an arc, Mathew and Sunitha [7] have classified arcs in the fuzzy graph. In [8], the authors introduced the strongest strong cycle in fuzzy ... See full document

... simple graph G, a subset D of V (G) is called a chromatic weak dom- inating set if D is a weak dominating set and χ(< D >) = ...partition, chromatic weak domatic partition can be ...a ... See full document

... a graph as follows: "Given any simple graph G and an integer k,does G have a complete k-coloring?" and investigated the achromatic number of the line graph, L(K), of the complete ... See full document

... Vernold Vivin. J received his B.Sc (2000) and M.Sc (2002) degree in Mathematics from Government Arts College (Bharathiar University), Coimbatore. He completed his M.Phil (2004) degree in Mathematics and his Doctoral ... See full document

... 7. Perfect graphs. We recall that perfect graphs are those for which, for every in- duced subgraph H , the chromatic number is equal to the clique number, that is, χ(H) = ω(H) . Perfect graphs form a widely ... See full document

... use graph-theoretic results and the partial isomorphism with chromatic ho- mology to provide a combinatorial interpretation for certain properties in Khovanov ...of chromatic homology over A 2 , ... See full document

... Motivated by the definition of W G P ( ) , Ilić [3] recently defined ( d G k , ) to be the generalized Wiener polarity index W G k ( ) for its significance. As a matter of fact, Gutman [4] showed that ( d G k , ) ... See full document

... In this section we give a bijective proof of the recurrence formula (1.2) in terms of acyclic orientations. We recall that an acyclic orientation of G is an assignment of arrows to its edges such that there are no ... See full document

... neighbourhood chromatic dominating set (nchd-set) if 𝐷 is a dominating set and 𝜒 < 𝑁 𝐷 > = ...neighbourhood chromatic dominating set of a graph G is called the neighbourhood chromatic ... See full document

... In graph theory domination and coloring are two popular research areas which have been extensively ...of graph domination was introduced by Berge C in 1958 in the name of coefficient of external ...a ... See full document

... incident graph elements are assigned the same color. The total chromatic number of G, denoted by χ T (G), is the smallest positive integer k for which there exists a total coloring π : V (G) ∪ E(G) → {1, 2, ... See full document