Equienergetic graphs
Equienergetic self-complementary graphs
In this paper equienergetic self-complementary graphs on vertices for every , and , are constructed.
Equifacetted 3-Spheres as Topes of Non-polytopal Matroid Polytopes.
Equilateral triangles in finite metric spaces.
Équilibre d'un graphe. Quelques résultats algébriques
Équilibre, équivalence, ordre et préordre à distance minimum d'un graphe complet
Les problèmes que nous traitons ici sont en partie familiers aux lecteurs de la revue. L'apport original consiste selon nous dans le fait d'avoir rapproché des problèmes classiques (équilibre d'un graphe, ordre à distance minimum) pour en souligner les analogies profondes et, du coup, plonger de manière féconde ces problèmes dans un ensemble plus large, en particulier en posant le problème de l'équivalence et du préordre à distance minimum d'un graphe complet. Notre exposé se présente donc comme...
Equipped graphs and modular lattices attached to them
Equitable colorations of graphs
Equitable coloring of Kneser graphs
The Kneser graph K(n,k) is the graph whose vertices correspond to k-element subsets of set {1,2,...,n} and two vertices are adjacent if and only if they represent disjoint subsets. In this paper we study the problem of equitable coloring of Kneser graphs, namely, we establish the equitable chromatic number for graphs K(n,2) and K(n,3). In addition, for sufficiently large n, a tight upper bound on equitable chromatic number of graph K(n,k) is given. Finally, the cases of K(2k,k) and K(2k+1,k) are...
Equitable coloring on total graph of bigraphs and central graph of cycles and paths.
Equitable hypergraph orientations.
Equitable matroids.
Equivalence classes of functions on finite sets.
Equivalence classes of Latin squares and nets in
The fundamental combinatorial structure of a net in is its associated set of mutually orthogonal Latin squares. We define equivalence classes of sets of orthogonal Latin squares by label equivalences of the lines of the corresponding net in . Then we count these equivalence classes for small cases. Finally we prove that the realization spaces of these classes in are empty to show some non-existence results for 4-nets in .
Equivalence of a Number-Theoretical Problem with a Problem from the Graph Theory
Equivalence of compositional expressions and independence relations in compositional models
We generalize Jiroušek’s (right) composition operator in such a way that it can be applied to distribution functions with values in a “semifield“, and introduce (parenthesized) compositional expressions, which in some sense generalize Jiroušek’s “generating sequences” of compositional models. We say that two compositional expressions are equivalent if their evaluations always produce the same results whenever they are defined. Our first result is that a set system is star-like with centre if...
Equivalence of the strengthened Hanna Neumann conjecture and the amalgamated graph conjecture.
Equivalences between isomorphism classes on infinite graphs
The paper studies some equivalence relations between isomorphism classes of countable graphs which correspond in a certain sense to various distances between isomorphism classes of finite graphs.
Equivalent classes for K₃-gluings of wheels
In this paper, the chromaticity of K₃-gluings of two wheels is studied. For each even integer n ≥ 6 and each odd integer 3 ≤ q ≤ [n/2] all K₃-gluings of wheels and create an χ-equivalent class.
Erdős regular graphs of even degree
In 1960, Dirac put forward the conjecture that r-connected 4-critical graphs exist for every r ≥ 3. In 1989, Erdös conjectured that for every r ≥ 3 there exist r-regular 4-critical graphs. A method for finding r-regular 4-critical graphs and the numbers of such graphs for r ≤ 10 have been reported in [6,7]. Results of a computer search for graphs of degree r = 12,14,16 are presented. All the graphs found are both r-regular and r-connected.