SOME RESULTS ON KRONECKER PRODUCT OF TWO GRAPHS
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2012, Vol 3, Issue 1
Abstract
We consider product graphs and recall the results associated to the product graphs. Paul M.Weichsel [3] defined the Kronecker product of graphs. He has proved a characterization for the product graphs to be connected graphs. He also obtained “If G1 and G2 are connected graphs with no odd cycles then has exactly two connected components.”E Sampath Kumar [2] has proved that for a connected graph & with no odd cycles G1 (K)G2 2G . v If G or G is a bipartite graph then G K G is bipartite graph iv If G and G are regular graphsthenG K G is also a regular graph
Authors and Affiliations
Dr. P. BHASKARUDU
Keywords
Related Articles
- EP ID EP98446
- DOI -
- Views 111
- Downloads 0
On Most Generalized Topologies on a Non Empty Set
The purpose of this paper is to introduce a notion of continuity called (G ,D)- continuity between two non empty sets X and Y, and its relationships with other functions are studied.
A Study on Quasi Class Q Operator
In this paper quasi class operator is introduced with example and compared with normaloid operator. Necessary and sufficient condition for a composition operator to be quasi class is given with an example. Also weighted...
A Common Fixed Point Theorem on Lohani and Bhadshah
The aim of this paper is to present a common fixed point theorem in a metric space which extends the results of P.C.Lohani V.H.Bhadshah using the weaker conditions such as Weakly compatible and Associated sequence.
A New Class Integral Representation Involving Exton’s Triple Hypergeometric Function X[sub]1[/sub]
The aim of this paper is to obtain eulerian kind generalized single integral which include Exton’s triple hy pergeometric function X[sub]1[/sub]. The results are established with the help of generalized Watson’s theorem...
Independent Domination of Splitted Graphs
A dominating set D of a splitted graph S(G) = ( V, E ) is an independent dominating set if the induced subgraph <D> has no edges. The independent domination number i[S(G)] of a graph S(G) is the minimum cardinality...