Zobrazeno 1 - 10
of 21
pro vyhledávání: '"B. D. Acharya"'
Publikováno v:
Communications in Algebra. 44:4697-4708
This paper introduces the notions of a zero-divisor labeling and the zero-divisor index of a graph using the zero-divisors of a commutative ring. Viewed in this way, the usual zero-divisor graph is a maximal graph with respect to a zero-divisor label
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e79b55f336a3c70ab27b05a2f0c273a
https://doi.org/10.1080/00927872.2015.1101471
https://doi.org/10.1080/00927872.2015.1101471
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 12, Iss 2, Pp 133-140 (2015)
Given a graph G = ( V , E ) , a set ψ of non-trivial paths, which are not necessarily open, called ψ -edges, is called a graphoidal cover of G if it satisfies the following conditions: ( G C − 1 ) Every vertex of G is an internal vertex of at mos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56554a447df87506a5628e3c3d31db44
Autor:
B. D. Acharya
Publikováno v:
Mathematics in Computer Science. 5:3-6
A hypergraph-property P is supra-hereditary if whenever a hypergraph H has property P and K is a hypergraph generated by a nonempty subset A of X(H), then K also has the property P. In this paper we give a characterization of irreducible supra-heredi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dffb74a89cdfe41c2eb565800cd2d85d
https://doi.org/10.1007/s11786-011-0072-7
https://doi.org/10.1007/s11786-011-0072-7
Autor:
B. D. Acharya, K. A. Germina
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 13:453-463
A (p, q)-graph G = (V, E) is called vertex-graceful if it admits a vertex-graceful numbering, which is defined as an injection f : E → {0, 1, 2,…, q*}, q* = max{p, q} such that the function fV : V → ℕ defined by the rule fV (v) = max{f (e) :
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae78ddc23e1df141c2cf47359c9f5b08
https://doi.org/10.1080/09720529.2010.10698307
https://doi.org/10.1080/09720529.2010.10698307
Publikováno v:
Designs, Codes and Cryptography. 57:91-105
A (v, β o , μ)-design over regular graph G = (V, E) of degree d is an ordered pair D = (V, B), where |V| = v and B is the set of maximum independent sets of G called blocks such that if i, j ? V, i ? j and if i and j are not adjacent in G then ther
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0fb9871e22cc9e74b1aa5222d6032018
https://doi.org/10.1007/s10623-009-9351-6
https://doi.org/10.1007/s10623-009-9351-6
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 12:481-487
In this paper, we study the embedding of a graph as an induced subgraph in a setgraceful graph, topologically set-graceful graph and set-sequential graph, each with a given property, leading to prove the NP-completeness of some parameters like chroma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8285fcf516f4467a7b49ff7bbba96128
https://doi.org/10.1080/09720529.2009.10698249
https://doi.org/10.1080/09720529.2009.10698249
Autor:
B. D. ACHARYA,S. M. HEGDE
Publikováno v:
Proceedings of Indian National Science Academy, Vol 22, Iss 7 (2015)
ON CERTAIN VERTEX VALUATIONS OF A GRAPH-I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doajarticles::eea86e154de06903225785938c7b369f
https://insa.nic.in/writereaddata/UpLoadedFiles/PINSA/20005a1f_553.pdf
https://insa.nic.in/writereaddata/UpLoadedFiles/PINSA/20005a1f_553.pdf
Autor:
B. D. ACHARYA
Publikováno v:
Proceedings of Indian National Science Academy, Vol 12, Iss 10 (2015)
ON CHARACTERIZING GRAPHS SWITCHING EQUIVALENT TO ACYCLIC GRAPHS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doajarticles::ba7f2c060d9e665a9fff02fdd5a91740
https://insa.nic.in/writereaddata/UpLoadedFiles/PINSA/20005a82_1187.pdf
https://insa.nic.in/writereaddata/UpLoadedFiles/PINSA/20005a82_1187.pdf
Autor:
Purnima Gupta, B. D. Acharya
Publikováno v:
Czechoslovak Mathematical Journal. 56:99-108
In this paper we extend the notion of weak degree domination in graphs to hypergraphs and find relationships among the domination number, the weak edge-degree domination number, the independent domination number and the independence number of a given
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5785131e9215b5f4cf5b8d7fb367aee2
https://doi.org/10.1007/s10587-006-0008-6
https://doi.org/10.1007/s10587-006-0008-6
Autor:
B. D. Acharya, Mukti Acharya
Publikováno v:
Electronic Notes in Discrete Mathematics. 15:6-9
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::623b60005bc7e40c496259f37343ddea
https://doi.org/10.1016/s1571-0653(04)00507-4
https://doi.org/10.1016/s1571-0653(04)00507-4