[PDF] Top 20 Some general classes of comatching graphs

... In many cases, we will give results concerning the construction of pairs of larger comatching graphs from certain "basic" pairs of comatchlng.. classes of comatching graphs..[r] ... See full document

... those classes of origin graphs that can be obtained by taking the origin semantics of some streaming string transducer (or any of the other equivalent ...origin graphs is the origin semantics ... See full document

... bipartite graphs) naturally arise in many data mining applications, including detecting cyber communities [ Kum99 ] , data compression [ Aga94 ] , epidemiology [ Mus07 ] , artificial intelligence [ Wil82 ] , and ... See full document

... graceful graphs is a generalization of the article ...graceful graphs, ...certain classes of graphs, including complete graphs and complete bipartite ... See full document

... circulant graphs by dif- ferent classes of graphs, complete bipartite graph as in Section ...and graphs that are connected by a one vertex as in Section ... See full document

... 12-representable graphs is properly included in the class of comparability graphs, and it properly includes the classes of co-interval graphs and permutation graphs as shown in Figure ... See full document

... more general classes obtained by sub- stituting vertices of the above classes by homogeneous ...give some definitions and preliminary re- ...remaining classes of graphs mentioned ... See full document

... molecular graph is a simple graph such that its vertices correspond to the atoms and the edges to the bonds. Note that hydrogen atoms are of- ten omitted. Molecular descriptors play a signifi- cant role in chemistry, ... See full document

... listing graphs that makes sure that no two equivalent graphs are being ...of graphs to enumerate, this algorithm is correct and achieves polynomial ...delay. Classes of graphs that can ... See full document

... large classes of graphs such as trees diameter two graphs, class zero graph ...of graphs is another attraction in this ...certain classes of graphs were discovered and is also ... See full document

... c : ( ) → { 1 , 2 , 3 ,...., }, ∈ , of the edges of G, where adjacent edges may be colored the same. A path in G is called a rainbow path if no two edges of it are colored the same. G is rainbow connected if G contains a ... See full document

... Until now, there are very few researches concerned solely with the -index. Furtula et al. [5], among other results, proved that for triangle–free graphs 2 ≤ . Abdo et al. [1] studied n-vertex trees with maximal ... See full document

... Topological indices are numerical quantities associated with different graph parameters. These are used to correlate chemi- cal structure of molecular graphs with various physical proper- ties, chemical ... See full document

... In this paper, i inspect the existence of Fibonacci Cordial Labeling of DS(Pn), DS(DFn), Edge duplication in K 1,n , Joint sum of Gl(n), DFn K 1,n and ringsum of star gra[r] ... See full document

... We use the standard notation. By an edge we mean an unoriented pair of vertices, and by an arc we mean an oriented pair of vertices. For a given graph G, V G ( ) and E G ( ) denote the set of its vertices and the set of ... See full document

... Retractable complexes are defined in this paper. It is proved that they have the fixed simplex property for simplicial maps. This implies the theorem of Wallace and the theorem of Rival and Nowakowski for finite trees: ... See full document

... A graph G =(V,E) with p vertices and q edges is said to admit cube difference labeling,if there exists a bijectionf:v(G)→{0,1,2,…,p} such that the induced function f* : E(G) → N given by f*(uv) =| [f(u)]3 - [f(v)]3 | for ... See full document

... Remark In the past few years, a number of upper bounds on the Estrada index of graphs have been established by using the algebraic techniques (see, for example, [, , , ]). In comparison to the algebraic ... See full document

... Remark 2.3. Throughout this paper we consider only graphs for which strong complementary acyclic dominating set exists. The complement of the strong complementary acyclic dominating set need not be a strong ... See full document

... on some graphs is in ...of some graphs were discussed in ...for some graphs using the properties of spiral ordering in the Gaussian ... See full document