منابع مشابه
The H - Line Signed Graph of a Signed Graph
A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ) (S = (G,μ)) where G = (V, E) is a graph called underlying graph of S and σ : E → (e1, e2, ..., ek) (μ : V → (e1, e2, ..., ek)) is a function, where each ei ∈ {+,−}. Particularly, a Smarandachely 2-signed graph or Smarandachely 2-marked graph is called abbreviated a signed graph or a marked graph. Given a ...
متن کاملConsistency in the Naturally Vertex-Signed Line Graph of a Signed Graph
A signed graph is a graph whose edges are signed. In a vertex-signed graph the vertices are signed. The latter is called consistent if the product of signs in every circle is positive. The line graph of a signed graph is naturally vertexsigned. Based on a characterization by Acharya, Acharya, and Sinha in 2009, we give constructions for the signed simple graphs whose naturally vertex-signed lin...
متن کاملResolution of Irreducible Integral Flows on a Signed Graph
We completely describe the structure of irreducible integral flows on a signed graph by lifting them to the signed double covering graph. A (real-valued) flow (sometimes also called a circulation) on a graph or a signed graph (a graph with signed edges) is a real-valued function on oriented edges, f : ~ E → R, such that the net inflow to any vertex is zero. An integral flow is a flow whose valu...
متن کاملThe Chromatic Number of a Signed Graph
In 1982, Zaslavsky introduced the concept of a proper vertex colouring of a signed graph G as a mapping φ : V (G) → Z such that for any two adjacent vertices u and v the colour φ(u) is different from the colour σ(uv)φ(v), where is σ(uv) is the sign of the edge uv. The substantial part of Zaslavsky’s research concentrated on polynomial invariants related to signed graph colourings rather than on...
متن کاملOn the Signed (Total) $k$-Domination Number of a Graph
Let k be a positive integer and G = (V,E) be a graph of minimum degree at least k − 1. A function f : V → {−1, 1} is called a signed k-dominating function of G if ∑ u∈NG[v] f(u) ≥ k for all v ∈ V . The signed k-domination number of G is the minimum value of ∑ v∈V f(v) taken over all signed k-dominating functions of G. The signed total k-dominating function and signed total k-domination number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics, Statistics and Informatics
سال: 2019
ISSN: 1339-0015,1336-9180
DOI: 10.2478/jamsi-2019-0003