Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: consistent sigraph

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Some results on semi-total signed graphs

100%

Sinha D., Garg P.

Discussiones Mathematicae Graph Theory

2011

tom 31

nr 4

625-638

A signed graph (or sigraph in short) is an ordered pair $S = (S^u,σ)$, where $S^u$ is a graph G = (V,E), called the underlying graph of S and σ:E → {+, -} is a function from the edge set E of $S^u$ into the set {+,-}, called the signature of S. The ×-line sigraph of S denoted by $L_×(S)$ is a sigraph defined on the line graph $L(S^u)$ of the graph $S^u$ by assigning to each edge ef of $L(S^u)$, the product of signs of the adjacent edges e and f in S. In this paper, first we define semi-total line sigraph and semi-total point sigraph of a given sigraph and then characterize balance and consistency of semi-total line sigraph and semi-total point sigraph.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Garg P.

1 Sinha D.

1 2011

Wyniki wyszukiwania

Some results on semi-total signed graphs