Zobrazeno 1 - 7
of 7
pro vyhledávání: '"H. J. Gowtham"'
Publikováno v:
Mathematical Problems in Engineering. 5/10/2024, Vol. 2024, p1-7. 7p.
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:
IAENG International Journal of Computer Science; Mar2023, Vol. 50 Issue 1, p233-237, 5p
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
Publikováno v:
Journal of Mathematical and Computational Science.
The partial complement of a graph G with respect to a set S is the graph obtained from G by removing the edges of induced subgraph and adding edges which are not in of G. In this paper we introduce the concept of distance energy of connected partial
Autor:
Nayak, Swati1 swati.nayak@manipal.edu, D'Souza, Sabitha1 sabitha.dsouza@manipal.edu, H. J., Gowtham1 gowtham.hj@manipal.edu, Bhat, Pradeep G.1 pg.bhat@manipal.edu
Publikováno v:
IAENG International Journal of Applied Mathematics. Dec2020, Vol. 50 Issue 4, p720-728. 9p.
Publikováno v:
Scopus-Elsevier
Let P = {V1, V2, V3, . . . , Vk} be a partition of vertex set V (G) of order k ≥ 2. For all Vi and Vj in P, ≠ 6= j, remove the edges between Vi and Vj in graph G and add the edges between Vi and Vj which are not in G. The graph GPk thus obtained
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ad6961c78ca77b090b64d73ec393ba5
http://www.scopus.com/inward/record.url?eid=2-s2.0-85048058921&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-85048058921&partnerID=MN8TOARS