نتایج جستجو برای: signed petersen graph
تعداد نتایج: 213036 فیلتر نتایج به سال:
We show that if G is a connected bridgeless cubic graph whose every 2-factor is comprised of cycles of length five then G is the Petersen graph. ”The Petersen graph is an obstruction to many properties in graph theory, and often is, or conjectured to be, the only obstruction”. This phrase is taken from one of the series of papers by Robertson, Sanders, Seymour and Thomas that is devoted to the ...
in this paper, we define the common minimal common neighborhooddominating signed graph (or common minimal $cn$-dominating signedgraph) of a given signed graph and offer a structuralcharacterization of common minimal $cn$-dominating signed graphs.in the sequel, we also obtained switching equivalencecharacterization: $overline{sigma} sim cmcn(sigma)$, where$overline{sigma}$ and $cmcn(sigma)$ are ...
The k-dimensional folded Petersen graph, FPk , is an iterative Cartesian product on the simple Petersen graph. As an essential component of folded Petersen cube, folded Petersen graph has many important properties. In this paper, we prove that the 3k-wide diameter and 3k-fault diameter of k-dimensional folded Petersen graph is either 2k + 1 or 2k + 2. Furthermore, we show that FPk is interval m...
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
We give a new proof that the Petersen graph is not 3-edge-colorable. J. Petersen introduced the most well known graph, the Petersen graph, as an example of a cubic bridgeless graph that is not Tait colorable, i.e. it is not 3-edge-colorable. It is easy to see the equivalence between the following statements, but most proofs for each of them use a case by case argument [1]. Theorem 1 For the Pet...
let $g = (v, e)$ be a simple graph. denote by $d(g)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $a(g)$ the adjacency matrix of $g$. the signless laplacianmatrix of $g$ is $q(g) = d(g) + a(g)$ and the $k-$th signless laplacian spectral moment of graph $g$ is defined as $t_k(g)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید