Results 11 to 20 of about 318 (45)
Negation Switching Equivalence in Signed Graphs [PDF]
, 2010 Unless mentioned or defined otherwise, for all terminology and notion in graph theory the reader is refer to [8].
Reddy, Siva Kota
core +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
Switching Equivalence in Symmetric n-Sigraphs-V [PDF]
, 2012 Introducing a new notion S-antipodal symmetric n-sigraph of a symmetric n-sigraph and its properties are obtained. Also giving the relation between antipodal symmetric n-sigraphs and S-antipodal symmetric n-sigraphs.
Geetha, M.C. +2 more
core +1 more source
A bivariate chromatic polynomial for signed graphs [PDF]
, 2014 We study Dohmen--P\"onitz--Tittmann's bivariate chromatic polynomial $c_\Gamma(k,l)$ which counts all $(k+l)$-colorings of a graph $\Gamma$ such that adjacent vertices get different colors if they are $\le k$.
Beck, Matthias, Hardin, Mela
core +1 more source
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
A Note On Jump Symmetric n-Sigraph [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to West; the nonstandard will be given in this paper as and when required.
Malathi, H.A., Savithri, H. C.
core +1 more source
A note on a walk-based inequality for the index of a signed graph
Special Matrices, 2021 We derive an inequality that includes the largest eigenvalue of the adjacency matrix and walks of an arbitrary length of a signed graph. We also consider certain particular cases.
Stanić Zoran
doaj +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
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
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