Characterizing the maximum genus of a connected graph
Characterizing which Powers of Hypercubes and Folded Hyper- cubes Are Divisor Graphs
In this paper, we show that Qkn is a divisor graph, for n = 2, 3. For n ≥ 4, we show that Qkn is a divisor graph iff k ≥ n − 1. For folded-hypercube, we get FQn is a divisor graph when n is odd. But, if n ≥ 4 is even integer, then FQn is not a divisor graph. For n ≥ 5, we show that (FQn)k is not a divisor graph, where 2 ≤ k ≤ [n/2] − 1.
Characters of finite quasigroups VII: permutation characters
Each homogeneous space of a quasigroup affords a representation of the Bose-Mesner algebra of the association scheme given by the action of the multiplication group. The homogeneous space is said to be faithful if the corresponding representation of the Bose-Mesner algebra is faithful. In the group case, this definition agrees with the usual concept of faithfulness for transitive permutation representations. A permutation character is associated with each quasigroup permutation representation,...
Chebyshev inequality for random graphs.
Cheeger inequalities for unbounded graph Laplacians
We use the concept of intrinsic metrics to give a new definition for an isoperimetric constant of a graph. We use this novel isoperimetric constant to prove a Cheeger-type estimate for the bottom of the spectrum which is nontrivial even if the vertex degrees are unbounded.
Chemins extrémaux d'un graphe doublement valué
Chess tableaux.
Chiral hypermaps of small genus.
Chiral hypermaps with few hyperfaces
Chohomological Aspects of Two-Graphs.
Choice Mappings of Certain Classes of Finite Sets.
Choice-Perfect Graphs
Given a graph G = (V,E) and a set Lv of admissible colors for each vertex v ∈ V (termed the list at v), a list coloring of G is a (proper) vertex coloring ϕ : V → S v2V Lv such that ϕ(v) ∈ Lv for all v ∈ V and ϕ(u) 6= ϕ(v) for all uv ∈ E. If such a ϕ exists, G is said to be list colorable. The choice number of G is the smallest natural number k for which G is list colorable whenever each list contains at least k colors. In this note we initiate the study of graphs in which the choice number equals...
Chord graphs - new means for representing graphs
Chordal intersection graphs of bands
Chromatic graphs, Ramsey numbers and the flexible atom conjecture.
Chromatic index of finite and infinite graphs
Chromatic Index of Hamiltonian Graphs
Chromatic number and some multiplicative vertex-degree-based indices of graphs
Chromatic Number And The Spectrum Of A Graph
Chromatic number for a generalization of Cartesian product graphs.