complete graphs
Maximum Oriented Forcing Number for Complete Graphs
... simple graphs) was introduced independently in [1] and ...on complete graphs and complete q-partite graphs, where we already get some interesting ...
12
Partitioning edge coloured complete graphs into monochromatic cycles and paths
... matic cycles. The small black dots represent single vertices. The large red and blue circles represent red and blue complete graphs of order specified by the numbers inside. The coloured lines between the ...
26
Fuzzy Chromatic Number of Line, Total and Middle Graphs of Fuzzy Complete Graphs
... fuzzy graphs is defined as a family offuz zy sets satisfying some ...for complete graphs, its fuzzy Line graph, middle fuzzy graph and total fuzzy graphs are foundand the results are ...
10
Single-row transformation of complete graphs
... In the channel assignment problem, we model the channels as the edges of a complete graph. The cells in the network are then represented as nodes in the graph. In the single-row axis, each of these cells is a zone ...
15
On multiplicity of quadrilaterals in Complete graphs
... For any simple connected graph G, the Ramsey number rG is defined as the smallest positive integer N such that every 2-coloring of the edges of the complete graph KN must contain a monoc[r] ...
12
HARMONIOUS COLORING OF MULTICOPY OF COMPLETE GRAPHS
... Francesc Antoni Muntaner-Batle was born in Mallorca (Majorca), Spain in 1974. He obtained his bachelors and masters from Western Michigan University (WMU) in mathematics, and in 2001 he got his Ph.D degree from ...
12
Hadamard matrices and 1 factorizations of complete graphs
... Theorem 2.6. Let p be a prime such that p ≡ 3 (mod 4) and 2 is a near- primitive root of p. Then there exists a perfect matching of the complete graph with vertex set Z p ∪ {c} consisting of edges of all possible ...
16
Vol 10, No 5 (2019)
... I n 2019, Basavanagoud et al. introduced new degree based topological indices called Kulli-Basava indices and studied their mathematical and chemical properties which have good response with mean isomer degeneracy. In ...
9
Interval Valued Intutionstic Fuzzy Graphs And It’s Some Property
... fuzzy graphs and examine various of their ...fuzzy complete graphs and some properties also interval-valued intutionstic fuzzy complete graphs and interval valued intutionstic fuzzy ...
5
Pseudo Complete Color Critical Graphs
... 1) Proof. Let V(G) = {v1, v2, , vn}. For each i, 1 ≤ ≤ , such that degreeof vi is not equal to n—1, add a new vertex ui and join ui to all the vertices with j >i and is not adjacent to vi. Let G' denote the resulting ...
8
Super Edge-antimagic Graceful labeling of Graphs
... graceful graphs is a generalization of the article ...graceful graphs, ...of graphs, including complete graphs and complete bipartite ...
6
NEW RESULTS ON SUPER EDGE MAGIC DEFICIENCY OF KITE GRAPHS
... provided the exact values for the super edge magic deficiencies of several classes of graphs, such as cycles, complete graphs, 2-regular graphs, and complete bipartite graphs K 2,m.. The[r] ...
12
On star polynomials, graphical partitions and reconstruction
... J., On a Class of Polynomials Associated with the Stars of a Graph and its Application to Node Disjoint Decompositions of Complete Graphs and Complete Bipartite Graphs into Stars, Canad.[r] ...
7
Seidel Integral Complete Split Graphs
... All graphs considered here are simple and undirected. The vertex set of a graph G is denoted by V (G) and the edge set by E(G). If e ∈ E(G) has end vertices u and v, then we say that u and v are adjacent and this ...
14
Complete parameterized presentations and almost convex Cayley graphs
... Cayley Graphs (page 5), of (the definition and terminology) chapter 1 be reread, but we make no apologies for repeating the following fundamental definitions and ...
183
Bipartite graphs whose edge algebras are complete intersections
... Bipartite graphs whose edge algebra is a complete intersection We begin this section by producing a minimal set of generators for k[G] where G is bipartite ...
16
Mod difference labeling of some classes of digraphs
... difference graphs similar to sum graphs and similar works we refer [8, ...difference graphs (paths, trees, cycles, special wheels, com- plete graphs, complete bipartite graphs ...
5
Eigenvalues of the resistance distance matrix of complete multipartite graphs
... paper, we determine the eigenvalues of the resistance-distance matrix of complete multipartite graphs. Also, we give some lower and upper bounds on the largest eigenvalue of the resistance-distance matrix ...
11
$m_j(P_4,G)$ for all Graphs G on 4 Vertices
... A.P.Burger and J.H.van Vuuren, Ramsey numbers in complete balanced multipartite graphs. V.Chavatal and F.Harary, Generalized Ramsey theory for graphs, III.[r] ...
8
Rainbow number of matchings in Halin graphs
... Halin graphs as a class of minimally 3-vertex-connected graphs: for every edge in the graph, the removal of that edge reduces the connectivity of the ...These graphs gained in significance with the ...
13