نتایج جستجو برای: prime graph
تعداد نتایج: 238682 فیلتر نتایج به سال:
A coprime labeling of a simple graph of order n is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the first n positive integers. In this paper, we consider when ladder graphs are prime and when the corresponding labeling may be done in a cyclic manner around the vertices of the ladder. Furthermore, we discuss c...
A graph is half-arc-transitive if its automorphism group acts transitively on vertices and edges, but not on arcs. Let p be a prime. Cheng and Oxley [On weakly symmetric graphs of order twice a prime, J. Combin. Theory B 42(1987) 196-211] proved that there is no half-arc-transitive graph of order 2p, and Alspach and Xu [ 12 -transitive graphs of order 3p, J. Algebraic Combin. 3(1994) 347-355] c...
We show that almost every Cayley graph Γ of an abelian group G of odd prime-power order has automorphism group as small as possible. Additionally, we show that almost every Cayley (di)graph Γ of an abelian group G of odd prime-power order that does not have automorphism group as small as possible is a normal Cayley (di)graph of G (that is, GL/Aut(Γ)).
It is proved that the simple group 2E6(2) recognized by its prime graph.
In this paper, we prove that every vertex-transitive graph can be expressed as the edge-disjoint union of symmetric graphs. We define a multicycle graph and conjecture that every vertex-transitive graph cam be expressed as the edge-disjoint union of multicycles. We verify this conjecture for several subclasses of vertextransitive graphs, including Cayley graphs, multidimensional circulants, and...
Rank-width is a graph complexity measure that has many structural properties. It is known that the rank-width of an undirected graph is the maximum over all induced prime graphs with respect to split decomposition and an undirected graph has rank-width at most 1 if and only if it is a distance-hereditary graph. We are interested in an extension of these results to directed graphs. We give sever...
Given a graph G, a subset M of V (G) is a module of G if for each v ∈ V (G) ∖M , v is adjacent to all the elements of M or adjacent to none of them. For instance, V (G), ∅ and {v} (v ∈ V (G)) are modules of G called trivial. Given a graph G, ωM(G) (respectively αM(G)) denotes the largest integer m such that there is a module M of G which is a clique (respectively a stable) set in G with ∣M ∣ = ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید