Zobrazeno 1 - 10
of 32
pro vyhledávání: '"U. Samee"'
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 331-345 (2021)
For a finite commutative ring ℤn with identity 1 ≠ 0, the zero divisor graph Γ(ℤn) is a simple connected graph having vertex set as the set of non-zero zero divisors, where two vertices x and y are adjacent if and only if xy=0. We find the nor
Externí odkaz:
https://doaj.org/article/3ad1b70c76084818aae275be965f6eb2
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 7, Iss 2, Pp 315-328 (2019)
Let G be a simple graph with n vertices, m edges and having adjacency eigenvalues λ1, λ2, …, λn. The energy E(G) of the graph G is defined as E(G) = ∑i = 1n∣λi∣. In this paper, we obtain the upper bounds for the energy E(G) in terms of th
Externí odkaz:
https://doaj.org/article/d110a3995b02495b8c3c0e958dd844ab
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 331-345 (2021)
For a finite commutative ring ℤn with identity 1 ≠ 0, the zero divisor graph Γ(ℤn) is a simple connected graph having vertex set as the set of non-zero zero divisors, where two vertices x and y are adjacent if and only if xy=0. We find the nor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4af8daf060fa8fac45b7936b964b8919
https://ejgta.org/index.php/ejgta/article/view/1006
https://ejgta.org/index.php/ejgta/article/view/1006
Publikováno v:
Acta Universitatis Sapientiae: Informatica, Vol 12, Iss 2, Pp 251-259 (2020)
The degree set of a k-partite graph is the set of distinct degrees of its vertices. We prove that every set of non-negative integers is a degree set of some k-partite graph.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::337fb248234e527fa2c47221eb39ae43
https://doaj.org/article/22dde92581d74bf2ac334ae806c9a875
https://doaj.org/article/22dde92581d74bf2ac334ae806c9a875
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 7, Iss 2, Pp 315-328 (2019)
Let G be a simple graph with n vertices, m edges and having adjacency eigenvalues λ1, λ2, …, λn. The energy E(G) of the graph G is defined as E(G) = ∑i = 1n∣λi∣. In this paper, we obtain the upper bounds for the energy E(G) in terms of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0232aa31fb668151b2c2910427914544
https://ejgta.org/index.php/ejgta/article/view/667
https://ejgta.org/index.php/ejgta/article/view/667
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 22:1-8
An r-graph is a multigraph in which two vertices are joined by at most r edges. An r-complete graph on n vertices, denoted by , is an r-graph on n vertices in which each pair of vertices is...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f4e7e3470f689f9e03c372f72f05431
https://doi.org/10.1080/09720529.2018.1555079
https://doi.org/10.1080/09720529.2018.1555079
Publikováno v:
Acta Universitatis Sapientiae: Informatica, Vol 10, Iss 2, Pp 183-217 (2018)
The authors in the paper [15] presented an algorithm that generates uniformly all the bipartite realizations and the other algorithm that generates uniformly all the simple bipartite realizations whenever A is a bipartite degree sequence of a simple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50a5a5f24d20ba5d3dc52615c7a8e35a
https://doi.org/10.2478/ausi-2018-0010
https://doi.org/10.2478/ausi-2018-0010
Publikováno v:
Linear Algebra and its Applications. 551:18-35
Let S = ( G , σ ) be a signed graph of order n and size m, where G is its underlying graph and σ is the sign function. A connected signed graph S is said to be bicyclic if m = n + 1 . In this paper, we provide characterizations of bicyclic signed g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c4c6cf18a1629d82bd881d19e3ea8ff
https://doi.org/10.1016/j.laa.2018.03.047
https://doi.org/10.1016/j.laa.2018.03.047
Publikováno v:
Acta Universitatis Sapientiae: Mathematica, Vol 10, Iss 1, Pp 189-197 (2018)
Let T(M; x,y) = ∑ij Tij xiyjdenote the Tutte polynomial of the matroid M. If Tij is a corner of T (M; x, y), then Tij counts the sets of corank i and nullity j and each such set is a cyclic flat of M. The main result of this article consists of ext
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02298dc4060096662de575618a354a5e
https://doaj.org/article/0a5a6042863741d883a3c4c0f4d107e5
https://doaj.org/article/0a5a6042863741d883a3c4c0f4d107e5
Autor:
U. Samee, Shariefuddin Pirzada
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 6, Iss 1, Pp 84-94 (2018)
A k-partite r-digraph(multipartite multidigraph) (or briefly MMD)(k ≥ 3, r ≥ 1) is the result of assigning a direction to each edge of a k-partite multigraph that is without loops and contains at most r edges between any pair of vertices from dis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::762495b287aeeb941328f4af87fa104e
https://ejgta.org/index.php/ejgta/article/view/482
https://ejgta.org/index.php/ejgta/article/view/482