نتایج جستجو برای: signed petersen graph
تعداد نتایج: 213036 فیلتر نتایج به سال:
This paper studies learning meaningful node representations for signed graphs, where both positive and negative links exist. problem has been widely studied by meticulously designing expressive graph neural networks, as well capturing the structural information of through traditional structure decomposition methods, e.g., spectral theory. In this paper, we propose a novel representation framewo...
We prove a conjecture of Saito that if a graph G with ≥ 3 has no cycle of length 1 (mod 3), then G has an induced subgraph which is isomorphic to the Petersen graph. The above result strengthened the result by Dean et al. that every 2-connected graph with ≥ 3 has a (1 mod 3)-cycle if G is not isomorphic to the Petersen graph. ? 2001 Elsevier Science B.V. All rights reserved.
Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...
The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy. In the literature the construction of equienergetic signed graphs are reported. In this paper we obtain the characteristic polynomial and energy of the join of two signed graphs and thereby we give another construction ...
Let $G$ be a finite and simple graph with vertex set $V(G)$. A nonnegative signed total Roman dominating function (NNSTRDF) on a graph $G$ is a function $f:V(G)rightarrow{-1, 1, 2}$ satisfying the conditionsthat (i) $sum_{xin N(v)}f(x)ge 0$ for each $vin V(G)$, where $N(v)$ is the open neighborhood of $v$, and (ii) every vertex $u$ for which $f(u...
We exhibit a graceful labelling for each generalised Petersen graph P8t,3 with t ≥ 1. As an easy consequence, we obtain that for any fixed t the corresponding graph is the unique starter graph for a cyclic edgedecomposition of the complete graph K2t+1. Due to its extreme versatility, the technique employed looks promising for finding new graceful labellings, not necessarily involving generalise...
We characterize all groups which can occur as the topological symmetry group or orientation preserving of some embedding Petersen graph in [Formula: see text].
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید