The Petersen Graph, Blocks, and Actions of A5

This article has been retracted by the publisher.

Rubei et. al., established results for the distance matrix of positive weighted Petersen graphs. Focusing on the properties of the distance matrix, we generalized positive weighted Petersen graphs results to Kneser graphs. We analyzed theorems established by Rubei et al. and used girth of the generalized Petersen graphs and Kneser graphs to conclude generalizations. Further, we examined the properties of positive weighted generalized Petersen graphs. We generalized the properties of distance matrices of positive weighted Petersen graphs to positive weighted generalized Petersen graphs. Keywords: Petersen graph, generalized Petersen graph, Kneser graph, weighted graph, cubic graph, odd graph, girth

Hypergraphes de Petersen! Hypergraphes de Moore?

Genetics is the science of trait from the parent to the descendant. In biology, genetics pass a series of genes unification process that takes place in the chromosome. The results of genes unification will form the nature and character of the generation. This particular genetic process also applies in graph theory. Genetics on graph theory is divided into two: breeding and parthenogenesis. This present study elaborated a single type of genetic processes that was parthenogenesis which is applied on a Petersen graph. Through the similar process to genetics in biology, Petersen graph will be reconstructed and combined with other graphs (gene) in purposes to create a descendant or a new graph with new nature and characteristic. Based on the result of parthenogenesis on this Petersen graph, there was derived a graph which has 18 edges and 12 vertices, isomorphism toward another Petersen graph, Hamiltonian, and has 3 girth and symmetric.

In 2007, Banica and Bichon asked whether the well-known Petersen graph has quantum symmetry. In this article, we show that the Petersen graph has no quantum symmetry, i.e. the quantum automorphism group of the Petersen graph is its usual automorphism group, the symmetric group $S_5$.

The Petersen graph occupies an important position in the development of several areas of modern graph theory because it often appears as a counter-example to important conjectures. In this account, the authors examine those areas, using the prominent role of the Petersen graph as a unifying feature. Topics covered include: vertex and edge colourability (including snarks), factors, flows, projective geometry, cages, hypohamiltonian graphs, and 'symmetry' properties such as distance transitivity. The final chapter contains a pot-pourri of other topics in which the Petersen graph has played its part. Undergraduate students will be able to profit from reading this book as the prerequisites are few; thus it could be used for a second course in graph theory. On the other hand, the authors have also included a number of unsolved problems as well as topics of recent study. Thus it will also be useful as a reference for graph theorists.

It is shown that there exists a decomposition of K into edge-disjoint copies of the Petersen graph if and only if υ ≡ 1 or 10 (mod 15), υ ≠ 10.

A dominating set $S$ of a graph $G$ is perfect if each vertex of G is dominated by exactly one vertex in $S$. We study the minimum perfect dominating sets in the Petersen graph and in the Clebsch graph. In this paper we show that every minimum perfect dominating set in the Petersen graph and the Clebsch graph induces $K_{1,3}$ and $C_4$ respectively. Further we establish that these classes of minimum perfect dominating sets of Clebsch graph form Partially Balanced Incomplete Block Designs with the parameters (16, 40, 10, 4, 1, 4).

Objectives:The Petersen graph is non-planar, meaning it cannot be drawn on a plane without edge crossings. This limits its use in applications requiring planar graphs, such as circuit board design, geographic mapping, or any domain where planar embeddings are essential. The Petersen graph is fixed with only 10 vertices and 15 edges. Its small size can make it unsuitable for modelling or analysing larger, more complex systems. The weakness of unsuitable for modelling or analysing larger, more complex systems estimation is the lack of consideration of the graph and it is not a function of the overall graph, because it uses the 10 vertices and 15 edges value. Methods:It is used as a counterexample in problems involving Hamiltonian graphs.It is highly symmetric, with 120 automorphisms. Algorithms like Dijkstra’s or Floyd-Warshall can be applied to find shortest paths in the modified Petersen graph for weighted or unweighted cases. Findings:This paper proposes a new modified Petersen Graph which means increase the vertices upto nth term and edges are mthterm (say k). The accuracy of the proposed method has been studied through entire paper. Novelty:The Petersen graph is a remarkable and widely studied object in graph theory. Vertex-transitivity: All vertices are structurally identical, meaning the graph looks the same from any vertex. Edge-transitivity: All edges are structurally identical. Automorphism group: The graph has 120 automorphisms, equivalent to the symmetric group S5.

We seek him here,We seek him there,Those Frenchies seek him everywhere.Is he in heaven? Is he in hell,That damned elusive Pimpernel?

Lovász (1987) proved that every matching covered graph $G$ may be uniquely decomposed into a list of bricks (nonbipartite) and braces (bipartite); we let $b(G)$ denote the number of bricks. An edge $e$ is removable if $G-e$ is also matching covered; furthermore, $e$ is $b$-invariant if $b(G-e)=1$, and $e$ is quasi-$b$-invariant if $b(G-e)=2$. (Each edge of the Petersen graph is quasi-$b$-invariant.)
 A brick $G$ is near-bipartite if it has a pair of edges $\{e,f\}$ so that $G-e-f$ is matching covered and bipartite; such a pair $\{e,f\}$ is a removable doubleton. (Each of $K_4$ and the triangular prism $\overline{C_6}$ has three removable doubletons.) Carvalho, Lucchesi and Murty (2002) proved a conjecture of Lovász which states that every brick, distinct from $K_4$, $\overline{C_6}$ and the Petersen graph, has a $b$-invariant edge.
 A cubic graph is essentially $4$-edge-connected if it is $2$-edge-connected and if its only $3$-cuts are the trivial ones; it is well-known that each such graph is either a brick or a brace; we provide a graph-theoretical proof of this fact.
 We prove that if $G$ is any essentially $4$-edge-connected cubic brick then its edge-set may be partitioned into three (possibly empty) sets: (i) edges that participate in a removable doubleton, (ii) $b$-invariant edges, and (iii) quasi-$b$-invariant edges; our Main Theorem states that if $G$ has two adjacent quasi-$b$-invariant edges, say $e_1$ and $e_2$, then either $G$ is the Petersen graph or the (near-bipartite) Cubeplex graph, or otherwise, each edge of $G$ (distinct from $e_1$ and $e_2$) is $b$-invariant. As a corollary, we deduce that each essentially $4$-edge-connected cubic non-near-bipartite brick $G$, distinct from the Petersen graph, has at least $|V(G)|$ $b$-invariant edges.

On a Conjecture of Lovász Concerning Bricks: I. The Characteristic of a Matching Covered Graph

In graph theory, graph colorings are a major area of study. Graph colorings involve the constrained assignment of labels (colors) to vertices or edges. There are many types of colorings defined in the literature, the most common being the proper vertex coloring. The proper vertex $k$ -coloring is defined as a vertex coloring from a set of $k$ colors such that no two adjacent vertices have the same color. In this paper, we focus on a variant of the proper vertex $k$ -coloring problem, termed graceful coloring. A graceful $k$ -coloring of an undirected connected graph $G$ is a proper vertex coloring using $k$ colors, that induces a proper edge coloring, where the color for an edge ( $u, v$ ) is the absolute value of the difference between the colors assigned to vertices $u$ and $v$ . The minimum $k$ for which a graph $G$ has a graceful $k$ -coloring is termed the graceful chromatic number of the graph. In a previous work (Mincu, Obreja, Popa, SYNASC 2019) we find the graceful chromatic number for some well-known graphs and classes of graphs, such as diamond graph, Petersen graph, Moser spindle graph, Goldner-Harary graph, friendship graphs, fan graphs, and others. In this study, we continue the investigation and find the graceful chromatic number for other well-known individual graphs, like Durer graph, Heawood graph, Mobius-Kantor graph, Nauru graph, Tietze's graph, Golomb graph and classes of graphs, like cactus, Gear, web graphs, etc. In a previous work (Mincu, Obreja, Popa, SYNASC 2019) we find the graceful chromatic number for some well-known graphs and classes of graphs, such as diamond graph, Petersen graph, Moser spindle graph, Goldner-Harary graph, friendship graphs, fan graphs, and others. In this study, we continue the investigation and find the graceful chromatic number for other well-known individual graphs, like Durer graph, Heawood graph, Mobius-Kantor graph, Nauru graph, Tietze's graph, Golomb graph and classes of graphs, like cactus, Gear, web graphs, etc.

A bridgeless cubic graph is said to have a 2‐bisection if there exists a 2‐vertex‐colouring of (not necessarily proper) such that: (i) the colour classes have the same cardinality, and (ii) the monochromatic components are either an isolated vertex or an edge. In 2016, Ban and Linial conjectured that every bridgeless cubic graph, apart from the well‐known Petersen graph, admits a 2‐bisection. In the same paper it was shown that every Class I bridgeless cubic graph admits such a bisection. The Class II bridgeless cubic graphs which are critical to many conjectures in graph theory are known as snarks, in particular, those with excessive index at least 5, that is, whose edge set cannot be covered by four perfect matchings. Moreover, Esperet et al. state that a possible counterexample to Ban–Linial's Conjecture must have circular flow number at least 5. The same authors also state that although empirical evidence shows that several graphs obtained from the Petersen graph admit a 2‐bisection, they can offer nothing in the direction of a general proof. Despite some sporadic computational results, until now, no general result about snarks having excessive index and circular flow number both at least 5 has been proven. In this study we show that treelike snarks, which are an infinite family of snarks heavily depending on the Petersen graph and with both their circular flow number and excessive index at least 5, admit a 2‐bisection.

This paper proposes an approach based on graph isomorphism to find the correspondence in relational matching. We describe a pseudo-automorphism group as Pseudo-aut (G) of a graph G, which is a set of all pseudo-automorphisms of G. We discuss some properties of the Pseudo-aut(C <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> ) and the relationships between various elements, establish the relationship between the pseudo-isomorphic and the perfect matching. From these we reach some important conclusions: the Petersen graph is a special element of the Pseudo-aut(C <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">5</sub> ); the composition of the Petersen graph is just one of its origins; there exists a Hamiltonian graph of order 12, which is 3-connected, 3-regular, non-planar, non-bipartite, and its girth is 5.