Results 21 to 30 of about 359 (57)
The H-Line Signed Graph of a Signed Graph [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required.
Rangarajan, R. +2 more
core +1 more source
Antimagic Labelings of Weighted and Oriented Graphs [PDF]
, 2019 A graph $G$ is $k$-$weighted-list-antimagic$ if for any vertex weighting $\omega\colon V(G)\to\mathbb{R}$ and any list assignment $L\colon E(G)\to2^{\mathbb{R}}$ with $|L(e)|\geq |E(G)|+k$ there exists an edge labeling $f$ such that $f(e)\in L(e)$ for ...
Berikkyzy, Zhanar +4 more
core +3 more sources
On Open Domination and Domination in Signed Graphs
, 2013 A graph whose edges are labeled either as positive or negative is called a signed graph. Motivated from the seminal paper of B. D. Acharya on domination in signed graphs, we in this article, provide answers to some of the problems in that paper and dene ...
K. A. Germina, P. Ashraf
semanticscholar +1 more source
Additive List Coloring of Planar Graphs with Given Girth
Discussiones Mathematicae Graph Theory, 2020 An additive coloring of a graph G is a labeling of the vertices of G from {1, 2, . . . , k} such that two adjacent vertices have distinct sums of labels on their neighbors.
Brandt Axel +2 more
doaj +1 more source
Restrained domination in signed graphs
Acta Universitatis Sapientiae: Mathematica, 2020 A signed graph Σ is a graph with positive or negative signs attatched to each of its edges. A signed graph Σ is balanced if each of its cycles has an even number of negative edges.
Mathias Anisha Jean +2 more
doaj +1 more source
Quasigroup associativity and biased expansion graphs
, 2006 We present new criteria for a multary (or polyadic) quasigroup to be isotopic to an iterated group operation. The criteria are consequences of a structural analysis of biased expansion graphs.
T. Zaslavsky
semanticscholar +1 more source
A note on the eigenvalue free intervals of some classes of signed threshold graphs
Special Matrices, 2019 We consider a particular class of signed threshold graphs and their eigenvalues. If Ġ is such a threshold graph and Q(Ġ ) is a quotient matrix that arises from the equitable partition of Ġ , then we use a sequence of elementary matrix operations to prove
Anđelić Milica +2 more
doaj +1 more source
A characterization of dissimilarity families of trees [PDF]
, 2016 Let ${\cal T}=(T,w)$ be a weighted finite tree with leaves $1,..., n$.For any $I :=\{i_1,..., i_k \} \subset \{1,...,n\}$, let $D_I ({\cal T})$ be the weight of the minimal subtree of $T$ connecting $i_1,..., i_k$; the $D_{I} ({\cal T})$ are called $k ...
Baldisserri, Agnese, Rubei, Elena
core +2 more sources
A Study on Integer Additive Set-Valuations of Signed Graphs [PDF]
, 2015 Let $\N$ denote the set of all non-negative integers and $\cP(\N)$ be its power set. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $f:V(G)\to \cP(\N)-\{\emptyset\}$ such that the induced function $f^+:E(G) \to
Germina, K. A., Sudev, N. K.
core +4 more sources
On graphlike k-dissimilarity vectors [PDF]
, 2013 Let {\cal G}=(G,w) be a positive-weighted simple finite graph, that is, let G be a simple finite graph endowed with a function w from the set of the edges of G to the set of the positive real numbers.
Baldisserri, Agnese, Rubei, Elena
core +1 more source