Complete Graph
Graham's Pebbling Conjecture Holds for the Product of a Graph and a Sufficiently Large Complete Graph
... For connected graphs G and H, Graham conjectured that π(G H) ≤ π(G)π(H) where π(G), π(H), and π(G H) are the pebbling numbers of G, H, and the Cartesian product G H, respectively. In this paper, we show that the ...
9
Some Variations of Y Dominating Functions of Corona Product Graph of a Cycle with a Complete Graph
... Some results on the minimal dominating functions of corona product graph of a cycle with a complete graph are presented in [4]. In this paper, we study the variations of Y – domination such as signed ...
6
Minimal Total Dominating Functions of Corona Product Graph of a Cycle with a Complete Graph
... Product of graphs occurs naturally in discrete mathematics as tools in combinatorial constructions. They give rise to important classes of graphs and deep structural problems. In this paper the concept of total ...
6
Total Edge Dominating Functions of Corona Product Graph of a Cycle with a Complete Graph
... [3] Anitha, J. and Maheswari, B. - Edge Dominating number of Corona Product Graph of a Cycle with a Complete Graph- International Journal of Computer Applications (IJCA), Volume 158, No 3, January ...
5
A HEURISTIC ALGORITHM FOR TSP OF COMPLETE GRAPH
... NP- complete problem[1-4]. It is a popular problem of graph theory which has many applicationin different field of engineering like in ...the complete graph K 2m + 2 , for m ≥ 2 and reported ...
7
Lower Bound of Crossing and Some Properties of Sub-graph of Complete Graph Related to VLSI Design
... a graph from a hypergraph has not been found ...of graph and hypergraph and their application for VLSI design technology have been studied by ...hyper graph with the edge of a graph is not ...
9
Some Complete- Graph Related Families Of Product Cordial (pc) Graphs.
... All graphs considered here are planar and simple graphs. for terminology and definition we refer G.F.Harare [6][7].Sundaram, Ponraj, and Somasundaram [8] introduced the notion of product cordial labelings. A product ...
8
Total Signed And Roman Edge Dominating Functions of Corona Product Graph of A Cycle With A Complete Graph
... Domination in graphs has been studied extensively in recent years. It is introduced by Ore [20] and Berge [8] and has become an emerging area of research in graph theory today. Many graph theorists, Allan, ...
8
The packing and covering of the complete graph I: the forests of order five
... INTRODUCTION Graphs in this paper are fiite with no multiple edges or loops, leineke [I] defined the general covering respectively, packing problem as follows" For a given graph G find t[r] ...
6
Minimum Covering Randić Energy of a Graph
... a graph G depends on the covering set that we take for ...star graph, complete graph, thorn graph of com- plete graph, crown graph, complete bipartite graph, ...
17
4-Difference Cordial Labeling of Cycle and Wheel Related Graphs
... undirected graph G = (V, ...every graph is a subgraph of a connected k-difference cordial ...bistar, complete graph, complete bipartite graph, comb, double comb, quadrilateral ...
5
Rainbow numbers for small cycles
... the graph by G ∪ H = (V (G) ∪ V (H), E(G) ∪ E(H ...the graph G ∪ H + {uv : u ∈ V (G), v ∈ V (H)}. A complete split graph K n + K ¯ s is the sum of a complete graph K n and an ...
7
On a class of polynomials associated with the Cliques in a graph and its applications
... Cover, Weights, Complete Graph, F-polynomial, Incorporated Graph, Proper Complete Graph, Proper Cover, Matching Polynomial.. 1980 AMS SUBJECT CLASSIEICATION CODE..[r] ...
8
A. IfPA , graph G is called compact graph. Compact graph can be seen as
... a graph is a compact graph is a difficult problem, and only few compact graphs are known at ...compact graph and have obtained some results: the graph constructed by the disjoint union of any ...
7
A NOTE ON LINE GRAPHS
... A graph G = (V, E) is said to be a star graph, if there exists a fixed vertex v such that E = {vu : u ∈ V, u 6= ...star graph is said to be an n-star graph, if the number of vertices of the ...
7
Redundancy Condition of Vertices in Coloring of Graphs S. Menakadevi 1K.M.Manikandan2
... A complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique ...A complete digraph is a directed graph in which every pair of distinct ...
5
A Study on Energy of Certain Graphs using MATLAB Program
... of graph G as the sum of the singular value of its incidence ...bipartite graph Ĝ for any graph G such that ...the graph is greater than the energy of its proper subgraph in the same ...of ...
6
Tenacity and some related results
... a graph G was introduced as a useful measure of the ”vul- nerability” of ...a graph G, T(G), is defined by T (G) = min{ |S|+τ(G−S) ω(G−S) }, where the minimum is taken over all vertex cutsets S of ...the ...
9
Efficient Generation of Power In Medium Voltage Direct Current Systems: Variable Speed Operation and Rectifier Considerations
... a graph and write E(G) = A ∪ B, where each edge of A belongs to at least one perfect matching and no edge of B ...(a complete graph on an even number of vertices) and balanced bicliques (a ...
95
Some Sequence of Wrapped Δ Labellings for the Complete Bipartite Graph
... The design of large disk array architectures leads to interesting combinatorial problems. Mini- mizing the number of disk operations when writing to consecutive disks leads to the concept of “cluttered orderings” which ...
12