نتایج جستجو برای: signed petersen graph
تعداد نتایج: 213036 فیلتر نتایج به سال:
Let P be the Petersen graph. The main results of this paper are the discovery of infinite families of chromatically equivalent pairs of P homeomorphs and the discovery of infinite families of flow equivalent pairs of P amallamorphs. In particular, three families of P homeomorphs with 8 parameters, five families with 7 parameters and many families with fewer parameters are obtained. Also one fam...
By hypotheses (a) and (c), if {i, j} is a 2-element subset of the type set I of Γ, then there are flags F of co-type {i, j}, such that res(F ) is a rank 2 geometry over the type set {i, j}, and all such {i, j}-residues are isomorphic. Hence, such a geometry Γ can be described by a diagram, in which the types (or even the exact isomorphism types) of all rank-2-residues are listed; this is often ...
A (1, 2)-eulerian weight w of a cubic graph is hamiltonian if every faithful circuit cover of the graph with respect to w is a set of two Hamilton circuits. Let G be a 3-connected cubic graph containing no Petersen-minor. It is proved in this paper that G admits a Hamilton weight if and only if G can be obtained from K4 by a series of 4 ↔ Y -operations. As a byproduct of the proof of the main t...
Robertson conjectured that the only 3-connected, internally 4-connected graph of girth 5 in which every odd cycle of length greater than 5 has a chord is the Petersen graph. We provide a counterexample to this conjecture.
In this note we consider two related infinite families of graphs, which generalize the Petersen and the Coxeter graph. The main result proves that these graphs are cores. It is determined which of these graphs are vertex/edge/arc-transitive or distance-regular. Girths and odd girths are computed. A problem on hamiltonicity is posed.
This article has restudied the Petersen family in Graph Theory. It discussed process of establishing this family. discussion leads to discovering some new properties family's members.
Let G = (V, E) be a graph. A subset S ⊆ V is a dominating set of G, if every vertex u ∈ V − S is dominated by some vertex v ∈ S. The domination number, denoted by γ(G), is the minimum cardinality of a dominating set. For the generalized Petersen graph G(n), Behzad et al. [A. Behzad, M. Behzad, C.E. Praeger, On the domination number of the generalized Petersen graphs, Discrete Mathematics 308 (2...
The line graph of an edge-signed graph carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized edge-signed graphs whose line graphs are consistent. Their proof applies Hoede’s relatively difficult characterization of consistent vertex-signed graphs. We give a different, constr...
Robertson has conjectured that the only 3-connected, internally 4-connected graph of girth 5 in which every odd cycle of length greater than 5 has a chord is the Petersen graph. We prove this conjecture in the special case where the graphs involved are also cubic. Moreover, this proof does not require the internal-4-connectivity assumption. An example is then presented to show that the assumpti...
It is shown that a matching covered graph has an ear decomposition with no more than one double ear if and only if there is no set S of edges such that |S∩A| is even for every alternating circuit A but |S ∩C| is odd for some even circuit C. Two proofs are presented. The first uses vector spaces and the second is constructive. Some applications are also given.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید