[PDF] Top 20 Upper Distance k-Cost Effective Number in the Join of Graphs

... and cost effective sets in ...of Graphs and Combinatorics, 15:211–218, ...Very cost effective bipartitions in ...of Graphs and Combinatorics, 12:155–160, ...in graphs ... See full document

... of graphs, where one can generate many new graphs from a given set of ...complexity, number of spanning trees, of some new join graphs, using linear algebra, Chebyshev polynomials and ... See full document

... the join of two graphs G and H, the previous results have already considered the case when G or H is ...the join of nontrivial connected graphs G and H is ... 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 ...disjoint graphs G G 1 , 2 ... See full document

... distinguishing number (index) D(G) (D 0 (G)) of a graph G is the least integer d such that G has an vertex labeling (edge labeling) with d labels that is preserved only by a trivial ...distinguishing number ... See full document

... domination number and is denoted by ...in graphs as well as for some of its relevant ...the join, corona or composition of graphs can be found in [8, 9, ... See full document

... of graphs called chemical graphs, which representing the chemical structure of a ...Molecular graphs are graphs in which the chemical structure under consideration are ...molecular ... See full document

... degree distance of ...and upper bounds for the reciprocal de- gree distance of graph in terms of other graph invariants including the de- gree distance, Harary index, the first Zagreb index, ... See full document

... p-reinforcement number of G, denoted by r p (G ) , is the minimum number of edges in G C that has to be added to G in order to reduce the p-domination number of the resulting ...p-domination ... See full document

... fuzzy graphs. The edge domination number of complete fuzzy graphs and complete fuzzy bipartite graphs are ...the join of fuzzy ... See full document

... degree distance and product-degree distance are degree-weight versions of the Wiener ...degree distance, which shows that the research of degree distance is a hot ...tion, join, ... See full document

... subgraph, then in [4], it is shown that there is a realization G of π containing H with the vertices of H having |V (H )| largest degree of π. In 2014 [1], Bu, Yan, X. Zhou and J. Zhou obtained Resistance distance ... See full document

... a join model that simplifies creation of and reasoning about joins in Map Reduce techniques which enable efficient parallel execution of arbitrary ...arbitrary join conditions to Map and Reduce functions, ... See full document

... The distance between two vertices u and v of a graph G is the number of edges of a shortest path from u to ...same distance in every connected induced subgraph containing them, then G is a ... See full document

... Triggered by the work of Furstenberg [10] who introduced the concept, the study of the Poisson boundary of Cayley graphs has grown into a very active research field; see [9] for a survey including many references. ... See full document

... In [1] introduced the concept of H-cordial labeling. [1] calls a graph H-cordial if it is possible to label the edges with the numbers from the set   1, 1  in such a way that, for some k, at each vertex v the ... See full document

... of distance two complementary tree dominating set is introduced in ...a distance two complementary tree dominating set, if for each u ∈V(G) – D, there exists a vertex v ∈ D such that d(u,v) ≤ 2, and also ... See full document

... The bounds for multiple domination can be improved if we impose additional restrictions on graph parameters, i.e. by considering smaller graph classes. Such restrictions are called threshold functions. Caro and Roditty ... See full document

... radio k-coloring of some graph G and S is a minimum radio k-coloring set if S is a radio k-coloring set of a minimum radio k-coloring of some graph ...1-chromatic number rc 1 (G) is ... See full document

... Abstract In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers.. We consider finite [r] ... See full document