Gouramma A. Gudodagi

Karnatak University

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Harishchandra S. Ramane

Karnatak University

Vinayak V. Manjalapur

Karnatak University

Raju B. Jummannaver

Karnatak University

Ajith S. Hanagawadimath

Karnatak University

Ashwini S. Yalnaik

Davangere University

Bing Zhou

Guilin University of Technology

K. Channegowda Nandeesh

Karnatak University

Abdollah Alhevaz

University of Shahrood

Iván Gutman

University of Kragujevac

Ishwar B. Baidari

Karnatak University

Cooperative Institutions

Karnatak University

Davangere University

KLS Gogte Institute of Technology

Guilin University of Technology

Ministry of Industry and Information Technology

People's Hospital of Cangzhou

Nanjing University of Science and Technology

Central China Normal University

China Electric Power Research Institute

State Key Laboratory of Chemical Engineering

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Computation of general Randi\'{c} polynomial and general Randic energy of some graphs

DOAJ (DOAJ: Directory of Open Access Journals) (2020)

Harishchandra S. Ramane Gouramma A. Gudodagi

Source

Cite

Citations (0)

Degree subtraction eigenvalues and energy of graphs

DOAJ (DOAJ: Directory of Open Access Journals) (2018)

Harishchandra S. Ramane K. Channegowda Nandeesh Gouramma A. Gudodagi Bing Zhou

Degree (music)

Subtraction

Source

Cite

Citations (5)

Hamming index of graphs with respect to its incidence matrix

Indonesian Journal of Combinatorics (2022)

Harishchandra S. Ramane Ishwar B. Baidari Raju B. Jummannaver Vinayak V. Manjalapur Gouramma A. Gudodagi

Let $B(G)$ be the incidence matrix of a graph $G$. The row in $B(G)$ corresponding to a vertex $v$, denoted by $s(v)$ is the string which belongs to $\Bbb{Z}_2^n$, a set of $n$-tuples over a field of order two. The Hamming distance between the strings $s(u)$ and $s(v)$ is the number of positions in which $s(u)$ and $s(v)$ differ. In this paper we obtain the Hamming distance between the strings generated by the incidence matrix of a graph. The sum of Hamming distances between all pairs of strings, called Hamming index of a graph is obtained.

Hamming graph

Hamming distance

Incidence matrix

Hamming(7,4)

Hamming weight

Distance matrix

10.19184/ijc.2022.6.2.4

Cite

Citations (0)

On Complementary Distance Signless Laplacian Spectral Radius and Energy of Graphs

Iranian Journal of Mathematical Sciences and Informatics (2019)

Harishchandra S. Ramane Gouramma A. Gudodagi Vinayak V. Manjalapur Abdollah Alhevaz

Spectral Radius

Source

Cite

Citations (1)

Reciprocal complementary distance equienergetic graphs

Asian-European Journal of Mathematics (2016)

Harishchandra S. Ramane Gouramma A. Gudodagi

The reciprocal complementary distance (RCD) matrix of a graph [Formula: see text] is defined as [Formula: see text], in which [Formula: see text] if [Formula: see text] and [Formula: see text] if [Formula: see text], where [Formula: see text] is the diameter of [Formula: see text] and [Formula: see text] is the distance between the [Formula: see text]th and [Formula: see text]th vertex of [Formula: see text]. The [Formula: see text]-energy [[Formula: see text]] of [Formula: see text] is defined as the sum of the absolute values of the eigenvalues of RCD-matrix of [Formula: see text]. Two graphs [Formula: see text] and [Formula: see text] are said to be RCD-equienergetic if [Formula: see text]. In this paper, we obtain the RCD-eigenvalues and RCD-energy of the join of certain regular graphs and thus construct the non-RCD-cospectral, RCD-equienergetic graphs on [Formula: see text] vertices, for all [Formula: see text].

Reciprocal

10.1142/s1793557116500844

Cite

Citations (3)

On Terminal Hosoya Polynomial of Some Thorn Graphs

viXra (2018)

Harishchandra S. Ramane Gouramma A. Gudodagi Raju B. Jummannaver

In this paper we obtain the terminal Hosoya polynomial for caterpillers, thorn stars and thorn rings. These results generalizes the existing results.

Source

Cite

Citations (0)

Laplacian energy of union and Cartesian product and Laplacian equienergetic graphs

Kragujevac Journal of Mathematics (2015)

Harishchandra S. Ramane Gouramma A. Gudodagi Iván Gutman

The Laplacian energy of a graph G with n vertices and m edges is defined as LE(G) = Σ i=1 |μi 2m/n|, where μ1; μ2, … , μn are the Laplacian eigenvalues of G. If two graphs G1 and G2 have equal average vertex degrees, then LE(G1 υ G2) = LE(G1) + LE(G2). Otherwise, this identity is violated. We determine a term Ξ, such that LE(G1) + LE(G2) Ξ ≤ LE(G1 υ G2) ≤ LE(G1)+LE(G2)+ Ξ holds for all graphs. Further, by calculating LE of the Cartesian product of some graphs, we construct new classes of Laplacian non-cospectral, Laplacian equienergetic graphs.

Cartesian product

10.5937/kgjmath1502193r

Cite

Citations (3)