Results 11 to 20 of about 359 (57)
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
On ordering of minimal energies in bicyclic signed graphs
Acta Universitatis Sapientiae: Informatica, 2021 Let S = (G, σ) be a signed graph of order n and size m and let x1, x2, ..., xn be the eigenvalues of S. The energy of S is defined as ɛ(S)=∑j=1n|xj|\varepsilon \left( S \right) = \sum\limits_{j = 1}^n {\left| {{x_j}} \right|}. A connected signed graph is
Pirzada S. +2 more
doaj +1 more source
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
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
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
Total Minimal Dominating Signed Graph [PDF]
, 2010 Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is ...
Reddy, Siva Kota, Vijay, S.
core +1 more source
On Laplacian spectrum of unitary Cayley graphs
Acta Universitatis Sapientiae: Informatica, 2021 Let R be a commutative ring with unity 1 ≠ 0 and let R× be the set of all unit elements of R. The unitary Cayley graph of R, denoted by GR = Cay(R, R×), is a simple graph whose vertex set is R and there is an edge between two distinct vertices x and y of
Pirzada S., Barati Z., Afkhami M.
doaj +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
On {a, b}-Edge-Weightings of Bipartite Graphs with Odd a, b
Discussiones Mathematicae Graph Theory, 2022 For any S ⊂ ℤ we say that a graph G has the S-property if there exists an S-edge-weighting w : E(G) → S such that for any pair of adjacent vertices u, v we have ∑e∈E(v) w(e) ≠ ∑e∈E(u) w(e), where E(v) and E(u) are the sets of edges incident to v and u ...
Bensmail Julien +2 more
doaj +1 more source
PRIME WEIGHTED GRAPH IN CRYPTOGRAPHIC SYSTEM FOR SECURE COMMUNICATION
, 2015 Cryptography is the study of techniques for ensuring the secrecy and authentication of the information. Public-key encryption schemes are secure only if the authenticity of the public-key is assured.
S. Agarwal, A. Uniyal
semanticscholar +1 more source