Discussiones Mathematicae Graph Theory, 05/2015, Volume 35, Issue 2, pp. 301 - 311

In this paper, we show that Q is a divisor graph, for n = 2, 3. For n ≥ 4, we show that Q is a divisor graph iff k ≥ n − 1. For folded-hypercube, we get FQ is...

hypercube | divisor graph | power of a graph | folded-hypercube

hypercube | divisor graph | power of a graph | folded-hypercube

Journal Article

Discussiones Mathematicae - Graph Theory, ISSN 1234-3099, 2015, Volume 35, Issue 2, pp. 301 - 311

In this paper, we show that Q(n)(k) is a divisor graph, for n = 2, 3. For n >= 4, we show that Q(n)(k) is a divisor graph iff k >= n - 1. For folded-hypercube,...

Divisor graph | Folded-hypercube | Hypercube | Power of a graph | MATHEMATICS | hypercube | divisor graph | power of a graph | folded-hypercube | CYCLES

Divisor graph | Folded-hypercube | Hypercube | Power of a graph | MATHEMATICS | hypercube | divisor graph | power of a graph | folded-hypercube | CYCLES

Journal Article

International journal of combinatorics, ISSN 1687-9163, 01/2014, Volume 2014

Let R be a commutative finite principal ideal ring with unity, and let G(R) be the simple graph consisting of nontrivial proper ideals of R as vertices such...

Eccentricity | Unity | Mathematical analysis | Graphs | Hulls (structures) | Hulls | Intersections | Rings (mathematics)

Eccentricity | Unity | Mathematical analysis | Graphs | Hulls (structures) | Hulls | Intersections | Rings (mathematics)

Journal Article

Rocky Mountain Journal of Mathematics, ISSN 0035-7596, 2012, Volume 42, Issue 1, pp. 1 - 13

Journal Article

International Journal of Mathematics and Mathematical Sciences, ISSN 0161-1712, 2007, Volume 2007

We presented a formula for the Wiener polynomial of the kth power graph. We use this formula to find the Wiener polynomials of the kth power graphs of paths,...

Journal Article

Journal of Algebraic Combinatorics, ISSN 0925-9899, 4/2008, Volume 27, Issue 2, pp. 187 - 203

...J Algebr Comb (2008) 27: 187–203 DOI 10.1007/s10801-007-0084-1 Tightening T uryn’s bound for Hadamard difference sets Omar A. AbuGhneim · Ken W. Smith Received...

Intersection numbers | Convex and Discrete Geometry | Hadamard difference sets | Characters | Mathematics | Group Theory and Generalizations | Order, Lattices, Ordered Algebraic Structures | Computer Science, general | Combinatorics | MATHEMATICS | intersection numbers | characters

Intersection numbers | Convex and Discrete Geometry | Hadamard difference sets | Characters | Mathematics | Group Theory and Generalizations | Order, Lattices, Ordered Algebraic Structures | Computer Science, general | Combinatorics | MATHEMATICS | intersection numbers | characters

Journal Article

Electronic Journal of Combinatorics, ISSN 1077-8926, 01/2006, Volume 14, Issue 1 R, pp. 1 - 17

We resolve the existence problem of (96, 20,4) difference sets in 211 of 231 groups of order 96. If G is a group of order 96 with normal subgroups of orders 3...

MATHEMATICS | MATHEMATICS, APPLIED

MATHEMATICS | MATHEMATICS, APPLIED

Journal Article

08/2018

In 1978, Robert Kibler at the National Security Agency in Fort Meade, Maryland published a description of all noncyclic difference sets with $k < 20$. Kibler's...

Mathematics - Combinatorics

Mathematics - Combinatorics

Journal Article

Ars Combinatoria, ISSN 0381-7032, 2013, Volume 111, pp. 401 - 419

There are 267 nonisomorphic groups of order 64. It was known that 259 of these groups admit (64, 28, 12) difference sets and the other eight groups do not...

Groups of order 64 | Difference set | Symmetric design | GAP | symmetric design | MATHEMATICS | difference set

Groups of order 64 | Difference set | Symmetric design | GAP | symmetric design | MATHEMATICS | difference set

Journal Article

The Rocky Mountain Journal of Mathematics, ISSN 0035-7596, 1/2012, Volume 42, Issue 1, pp. 1 - 13

The zero-divisor graph of a commutative ring with one (say R) is a graph whose vertices are the nonzero zero-divisors of this ring, with two distinct vertices...

Integers | Idealization | Prime numbers | Algebra | Cardinality | Discrete mathematics | Semigroups | Mathematical rings | Vertices | Integers modulo n | Clique number | 05C69 | 13A99 | Zero-divisor graph

Integers | Idealization | Prime numbers | Algebra | Cardinality | Discrete mathematics | Semigroups | Mathematical rings | Vertices | Integers modulo n | Clique number | 05C69 | 13A99 | Zero-divisor graph

Journal Article

Bulletin of the Malaysian Mathematical Sciences Society, ISSN 0126-6705, 04/2014, Volume 37, Issue 2

The zero-divisor graph of a commutative ring with unity (say ...) is a graph whose vertices are the nonzero zero-divisors of this ring, where two distinct...

Journal Article

UTILITAS MATHEMATICA, ISSN 0315-3681, 11/2014, Volume 95, pp. 289 - 294

Let Pn+1 be the path of order n + 1 on the vertices v(0), v(1), ... , v(n) and P-n+1(k) is the kth power of Pn+1. In this paper, we find the geodetic, hull,...

GRAPH | MATHEMATICS, APPLIED | paths | STATISTICS & PROBABILITY | Geodetic number | hull number | Steiner number | power of graphs | Power of graphs | Paths | Hull number

GRAPH | MATHEMATICS, APPLIED | paths | STATISTICS & PROBABILITY | Geodetic number | hull number | Steiner number | power of graphs | Power of graphs | Paths | Hull number

Journal Article

Ars Combinatoria, ISSN 0381-7032, 2014, Volume 113, pp. 85 - 95

In this paper, we prove that for any tree T, T-2 is a divisor graph if and only if T is a caterpillar and the diameter of T is less than six. For any...

Caterpillar | Divisor graph | Power of a graph | MATHEMATICS | divisor graph | power of a graph | CYCLES

Caterpillar | Divisor graph | Power of a graph | MATHEMATICS | divisor graph | power of a graph | CYCLES

Journal Article

Bulletin of the Malaysian Mathematical Sciences Society, ISSN 0126-6705, 2014, Volume 37, Issue 2, pp. 345 - 357

The zero-divisor graph of a commutative ring with unity (say R) is a graph whose vertices are the nonzero zero-divisors of this ring, where two distinct...

Integers modulo n | Zero-divisor graph | Independence number | MATHEMATICS | independence number | integers modulo n

Integers modulo n | Zero-divisor graph | Independence number | MATHEMATICS | independence number | integers modulo n

Journal Article

Ars Combinatoria, ISSN 0381-7032, 01/2010, Volume 94, pp. 371 - 380

In this paper, we prove that for any positive integers k, n with k >= 2, the graph P-n(k) is a divisor graph if and only if n <= 2k + 2, where P-n(k) is the...

Power of a cycle | Divisor graph | Power of a path | Divisor orientation | MATHEMATICS | GRAPHS

Power of a cycle | Divisor graph | Power of a path | Divisor orientation | MATHEMATICS | GRAPHS

Journal Article

Journal of Combinatorial Mathematics and Combinatorial Computing, ISSN 0835-3026, 08/2008, Volume 66, pp. 237 - 255

Journal Article

International journal of mathematics and mathematical sciences, ISSN 0161-1712, 2007, Volume 2007, pp. 1 - 6

We presented a formula for the Wiener polynomial of thekthpower graph. We use this formula to find the Wiener polynomials of thekthpower graphs of paths,...

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.