Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Pradeep G. Bhat"'
Publikováno v:
Mathematics, Vol 10, Iss 8, p 1203 (2022)
Let G(V,X) be a finite and simple graph of order n and size m. The complement of G, denoted by G¯, is the graph obtained by removing the lines of G and adding the lines that are not in G. A graph is self-complementary if and only if it is isomorphic
Externí odkaz:
https://doaj.org/article/10e1613fe3e943e5bb0da4f97d6e9203
Autor:
Pradeep G. Bhat, Sabitha D’Souza
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 14, Iss 2, Pp 142-148 (2017)
In this paper, we introduce the new concept of color Signless Laplacian energy . It depends on the underlying graph and the colors of the vertices. Moreover, we compute color signless Laplacian spectrum and the color signless Laplacian energy of fami
Externí odkaz:
https://doaj.org/article/a92c357bff324bcb9a687109cd3f194c
Autor:
Pradeep G. Bhat, Sabitha D'Souza
Publikováno v:
Transactions on Combinatorics, Vol 2, Iss 3, Pp 53-67 (2013)
Let G be graph with vertex set V(G) and edge set E(G) and the set A={0,1}. A mapping is called binary vertex labeling of G and l(v) is called the label of the vertex v under l. In this paper we introduce a new kind of graph energy for the binary labe
Externí odkaz:
https://doaj.org/article/b7c4bbb7a13a4fbe87ce5226a16ae8e9
Publikováno v:
Materials Today: Proceedings. 54:827-831
Publikováno v:
Владикавказский математический журнал. :51-64
Let $G$ be a simple connected graph. The energy of a graph $G$ is defined as sum of the absolute eigenvalues of an adjacency matrix of the graph $G$. It represents a proper generalization of a formula valid for the total $\pi$-electron energy of a co
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 15
Let [Formula: see text] be the adjacency matrix of a graph [Formula: see text]. Let [Formula: see text] denote the row entries of [Formula: see text] corresponding to the vertex [Formula: see text] of [Formula: see text]. The Hamming distance between
Publikováno v:
Mathematics; Volume 10; Issue 8; Pages: 1203
Let G(V,X) be a finite and simple graph of order n and size m. The complement of G, denoted by G¯, is the graph obtained by removing the lines of G and adding the lines that are not in G. A graph is self-complementary if and only if it is isomorphic
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 15
Let [Formula: see text] be a partition of vertex set [Formula: see text] of order [Formula: see text] of a graph [Formula: see text]. The [Formula: see text]-complement of [Formula: see text] denoted by [Formula: see text] is defined as for all [Form
Publikováno v:
Advances in Mathematics: Scientific Journal. 9:7093-7099
Publikováno v:
Advances in Mathematics: Scientific Journal. 9:3247-3264
Let G beagraphwithvertexset V (G) andedgeset X(G). Consider the set A = {0,1,2}. A labeling f : V (G) → A induces a partial edge labeling f∗ : X(G) → A defined by f∗(xy) = f(x), if and only if f(x) = f(y), for each edge xy ∈ X(G). For i