[PDF] Top 20 Asteroidal number for some product graphs

... For 3,7 and 8, consider any three vertices that are mutually non adjacent. For one vertex (among the three) , the removal of it’s closed neighbourhood will disconnect the path thereby leaving the other two vertices in ... See full document

... A Hamilton cycle of a graph is a cycle which passes through each vertex of the graph exactly once and the graph is Hamiltonian, if it contains a Hamilton cycle. A graph G is Hamiltonian laceable if there is a u-v ... See full document

... direct product, then there may be multiple different representations (direct products do not satisfy unique factorization) but each representation has the same number of irreducible ...tensor product ... See full document

... Abstract. An annihilator dominating set (ADS) is a representative technique for find- ing the induced subgraph of a graph which can help to isolate the vertices. A dominating set of graph G is called ADS if its induced ... See full document

... chromatic number are χ ( ) G ≤ χ g ( ) G ≤ ∆ ( ) G + 1 , ...chromatic number of tree graphs and proved that χ g ( ) T ≤ 4 ...chromatic number of cartesian product of two graphs ... See full document

... More number of labeling techniques found their starting point from graceful labeling introduced by ...Fibonacci product cordial labeling have introduced by Tessymol Abraham and Shiny Jose ... See full document

... Abstract. Let G = (V, E) be a simple connected and undirected graph. A set F of edges in G is called an edge dominating set if every edge e in E − F is adjacent to at least one edge in F . The edge domination ... See full document

... color number of a graph G as the maximum number of color classes which are strong dominating sets of G, and is denoted by sd  (G) , where the maximum is taken over all  -coloring of ...color number ... See full document

... The concept of graphoidal cover was introduced by Acharya and Sampathkumar[2] and further studied in [1, 3 ,7 ,8]. A graphoidal cover of a graph G is a collection ψ of (not necessarily open) paths in G satisfying the ... See full document

... paper we introduce the connected domination number on Cartesian product of simple fuzzy graphs and obtain the results for this parameter in fuzzy graph.. Keywords: dominating set; conn[r] ... See full document

... signed product cordial labeling of a graph is a function : ( ) → {−1, 1}such that each edge is assigned the label ( ) ( ), the number of vertices with label −1 andthe number of vertices with label 1 ... See full document

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

... two graphs using the adja- cency and the non-adjacency relations of these ...cartesian product, the corona product, the strong product, and the lexicographic product of graphs, ... See full document

... the number of unordered pairs of vertices of G whose distance is k. Some formulas are obtained for computing the generalized polarity Wiener index of the Cartesian product and the tensor ... See full document

... domination number or DD-number, γ 2 d (G) of a graph G is min{|S| : S is a DD − set in G} [4, ...domination number or TDD-number, γ t d (G) of G is min{|S| : S is a T DD −set in G} ... See full document

... 4. J. F. Fink, M. S. Jacobson, L. F. Kinch, and J. Roberts, “The bondage number of a graph”, Discrete Mathematics, vol. 86 (1-3) (1990) 47-57. https://doi.org/10.1016/0012-365X(90)90348-L 5. M. Fischermann, D. ... See full document

... Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not ... See full document

... of graphs, study of vertex subsets with specified properties and parameters evolving out of these subsets plays a crucial role in the study of ...independence number, chromatic number are few ... See full document

... of Number Theory, particularly, the “Theory of Congruences” in Graph Theory, thus paving way for the emergence of a new class of graphs, namely “Arithmetic ...Cayley graphs are another class of ... See full document

... For asteroidal triple-free graphs and graphs of bounded asteroidal number the stable degree can be computed in polynomial ...For graphs in these classes the treewidth is bounded ... See full document