Results 21 to 30 of about 1,002 (213)
Regular packings of regular graphs
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amauri Gutiérrez, Anna S. Lladó
openaire +2 more sources
Arithmetic completely regular codes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression.
Jacobus Koolen +3 more
doaj +1 more source
On extension of regular graphs [PDF]
Journal of Discrete Mathematical Sciences and Cryptography, 2018 arXiv admin note: substantial text overlap with arXiv:1407 ...
Banerjee, Anirban, Bej, Saptarshi
openaire +2 more sources
Journal of Algebraic SystemsRecently, a construction of minimal codes arising from a family of almost Ramanujan graphs was shown. Ramanujan graphs are examples of expander graphs that minimize the second-largest eigenvalue of their adjacency matrix.
Valentino Smaldore
doaj +1 more source
Games, 2020 We study the emergence of cooperation in structured populations with any arrangement of cooperators and defectors on the evolutionary graph. In a computational approach using structure coefficients defined for configurations describing such arrangements ...
Hendrik Richter
doaj +1 more source
b-Coloring of the Mycielskian of Some Classes of Graphs
Discussiones Mathematicae Graph Theory, 2022 The b-chromatic number b(G) of a graph G is the maximum k for which G has a proper vertex coloring using k colors such that each color class contains at least one vertex adjacent to a vertex of every other color class.
Raj S. Francis, Gokulnath M.
doaj +1 more source
The American Mathematical Monthly, 2011 A graph G=(V,E) is called a unit-distance graph in the plane if there is an injective embedding of V in the plane such that every pair of adjacent vertices are at unit distance apart. If additionally the corresponding edges are non-crossing and all vertices have the same degree r we talk of a regular matchstick graph.
Sascha Kurz, Rom Pinchasi
openaire +3 more sources
Some Properties of Regular Line Graphs
مجلة علوم ذي قار, 2019 In this paper, the concept of regular line graph has been introduced. The maximum number of vertices with different degrees in the regular line graphs has also been studied.
Akram Attar
doaj +4 more sources
Ars Mathematica Contemporanea, 2019 20 pages, 6 ...
Primoz Potocnik, Janos Vidali
openaire +6 more sources
On edge product cordial graphs [PDF]
Opuscula Mathematica, 2019 An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we characterize graphs admitting an edge product cordial labeling.
Jaroslav Ivančo
doaj +1 more source