Chandrashekar Adiga
University of Mysore
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Chandrashekar Adiga.
Discussiones Mathematicae Graph Theory | 2016
Chandrashekar Adiga; B. R. Rakshith
Abstract Let G and H be two graphs. The join G ∨ H is the graph obtained by joining every vertex of G with every vertex of H. The corona G ○ H is the graph obtained by taking one copy of G and |V (G)| copies of H and joining the i-th vertex of G to every vertex in the i-th copy of H. The neighborhood corona G★H is the graph obtained by taking one copy of G and |V (G)| copies of H and joining the neighbors of the i-th vertex of G to every vertex in the i-th copy of H. The edge corona G ◇ H is the graph obtained by taking one copy of G and |E(G)| copies of H and joining each terminal vertex of i-th edge of G to every vertex in the i-th copy of H. Let G1, G2, G3 and G4 be regular graphs with disjoint vertex sets. In this paper we compute the spectrum of (G1 ∨ G2) ∪ (G1 ★ G3), (G1 ∨ G2) ∪ (G2 ★ G3) ∪ (G1 ★ G4), (G1 ∨G2)∪(G1 ○G3), (G1 ∨G2)∪(G2 ○G3)∪(G1 ○G4), (G1 ∨G2)∪(G1 ◇G3), (G1 ∨ G2) ∪ (G2 ◇ G3) ∪ (G1 ◇ G4), (G1 ∨ G2) ∪ (G2 ○ G3) ∪ (G1 ★ G3), (G1 ∨ G2) ∪ (G2 ○ G3) ∪ (G1 ◇ G4) and (G1 ∨ G2) ∪ (G2 ★ G3) ∪ (G1 ◇ G4). As an application, we show that there exist some new pairs of equienergetic graphs on n vertices for all n ≥ 11.
Discrete Mathematics | 2018
Chandrashekar Adiga; Ranganatha Dasappa
Abstract In 2012, Lin (Electron. J. Combin. 19(2) (2012) #P17) investigated the 2 and 3-divisibility properties for p p ¯ o ( n ) , the number of overpartition pairs into odd parts. Using modular forms, he proved that for a fixed positive integer k , p p ¯ o ( n ) is almost always divisible by 2 k . In this paper, we prove several congruences for p p ¯ o ( n ) modulo higher powers of 2 in an elementary way.
Electronic Journal of Graph Theory and Applications (EJGTA) | 2016
Chandrashekar Adiga; B. R. Rakshith; K. N. Subba Krishna
In this paper we define extended corona and extended neighborhood corona of two graphs
Discussiones Mathematicae Graph Theory | 2006
Chandrashekar Adiga; Mahadev Smitha
G_{1}
Archive | 1985
S. C. Bhargava; Chandrashekar Adiga
and
Linear Algebra and its Applications | 2016
Chandrashekar Adiga; B. R. Rakshith; Wasin So
G_{2}
Journal of Number Theory | 2016
Chandrashekar Adiga; Nasser Abdo Saeed Bulkhali; D. Ranganatha; H. M. Srivastava
, which are denoted by
Ramanujan Journal | 2018
Chandrashekar Adiga; Ranganatha Dasappa
G_{1}\bullet G_{2}
Arabian Journal of Mathematics | 2018
Chandrashekar Adiga; M. S. Mahadeva Naika; D. Ranganatha; C. Shivashankar
and
Filomat | 2016
Chandrashekar Adiga; Ismail Naci Cangul; H. N. Ramaswamy
G_{1}\ast G_{2}