نتایج جستجو برای: signed petersen graph
تعداد نتایج: 213036 فیلتر نتایج به سال:
It is shown that every connected vertex-transitive graph of order 4p, where p is a prime, is hamiltonian with the exception of the Coxeter graph which is known to possess a Hamilton path. In 1969, Lovász [22] asked if every finite, connected vertex-transitive graph has a Hamilton path, that is, a path going through all vertices of the graph. With the exception of K 2 , only four connected verte...
Signed graphs provide models for investigating balance in connection with various kinds of social relations. Since empirical social networks always involve uncertainty because of errors due to measurement, imperfect observation or sampling, it is desirable to incorporate uncertainty into signed graph models. We introduce a stochastic signed graph and investigate the properties of some indices o...
let $g$ be a simple graph of order $n$ and size $m$.the edge covering of $g$ is a set of edges such that every vertex of $g$ is incident to at least one edge of the set. the edge cover polynomial of $g$ is the polynomial$e(g,x)=sum_{i=rho(g)}^{m} e(g,i) x^{i}$,where $e(g,i)$ is the number of edge coverings of $g$ of size $i$, and$rho(g)$ is the edge covering number of $g$. in this paper we stud...
Let k ≥ 1 be an integer, and let G be a finite and simple graph with vertex set V (G). A signed total Italian k-dominating function (STIkDF) on a graph G is a functionf : V (G) → {−1, 1, 2} satisfying the conditions that $sum_{xin N(v)}f(x)ge k$ for each vertex v ∈ V (G), where N(v) is the neighborhood of $v$, and each vertex u with f(u)=-1 is adjacent to a vertex v with f(v)=2 or to two vertic...
An edge uv in a graph Γ is directionally 2-signed (or, (2, d)signed) by an ordered pair (a, b), a, b ∈ {+, −}, if the label l(uv) = (a, b) from u to v, and l(vu) = (b, a) from v to u. Directionally 2-signed graphs are equivalent to bidirected graphs, where each end of an edge has a sign. A bidirected graph implies a signed graph, where each edge has a sign. We extend a theorem of Sriraj and Sam...
ABSTRACT In a signed graph, each link is labeled with either a positive or a negative sign. This is particularly appropriate to model polarized systems. Such a graph can be characterized through the notion of structural balance, which relies on the partitioning of the graph into internally solidary but mutually hostile subgroups. In this work, we show that signed graphs can be used to model and...
In this paper we prove that no signed graph on the complete graph Kp, p ≥ 6, is graceful, and we also give a characterization of graceful signed graphs on Kp, p ≤ 5. This implies that there is no subset A of cardinality p ≥ 6 from the set {0, 1, . . . , (p 2 ) − n}, n ≤ 1 2 ( p 2 ) , such that each element of the set {1, 2, . . . , n} occurs exactly twice and each element of the remaining set {...
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighted zeta function of an (irregular or regular) covering of a graph by equivalence classes of prime, reduced cycles of the base graph. As an application, we discuss the structure of balanced coverings of signed graphs.
A signed graph is called net regular if the sum of the signs of every edge incident to each vertex is constant. Graphs that admit a signing making them net regular are called net regularizable. In this paper, net regular signed trees are studied, including general properties, conditions for a tree to be net regularizable, and generating functions.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید