Results 41 to 50 of about 41,221 (298)
Line Signed Graph of a Signed Total Graph
Electronic Notes in Discrete Mathematics, 2017 Abstract A signed total graph is an ordered pair T Σ ( Γ ( R ) ) : = ( T ( Γ ( R ) ) , σ ) , where T ( Γ ( R ) ) is the total graph of a commutative ring R, called the underlying graph of T Σ ( Γ ( R ) ) and T Σ ( Γ ( R ) ) is associated with a signing of its edges (a, b)
Mukti Acharya +3 more
openaire +1 more source
COMMON-EDGE SIGNED GRAPH OF A SIGNED GRAPH [PDF]
Journal of the Indonesian Mathematical Society, 2010 A Smarandachely k-signed graph (Smarandachely k-marked graph) is anordered pair....DOI : http://dx.doi.org/10.22342/jims.16.2.34.105 ...
P. Siva Kota Reddy +2 more
openaire +1 more source
ON THE SIGNED MATCHINGS OF GRAPHS [PDF]
Facta Universitatis, Series: Mathematics and Informatics, 2020 For a graph $G$ and any $v\in V(G)$, $E_{G}(v)$ is the set of all edges incident with $v$. A function $f:E(G)\rightarrow \{-1,1\}$ is called a signed matching of $G$ if $\sum_{e\in E(v)}f(e) \leq 1$ for every $ {v\in V(G)}$. For a signed matching $x$, set $x(E(G))=\sum_{e\in E(G))}x(e)$.
Javan, Samane, Maimani, Hamid Reza
openaire +2 more sources
On the Aα-Eigenvalues of Signed Graphs
Mathematics, 2021 For α∈[0,1], let Aα(Gσ)=αD(G)+(1−α)A(Gσ), where G is a simple undirected graph, D(G) is the diagonal matrix of its vertex degrees and A(Gσ) is the adjacency matrix of the signed graph Gσ whose underlying graph is G.
Germain Pastén, Oscar Rojo, Luis Medina
doaj +1 more source
Laplacian integral subcubic signed graphs
, 2021 A (signed) graph is called Laplacian integral if all eigenvalues of its Laplacian matrix are integers. In this paper, we determine all connected Laplacian integral signed graphs of maximum degree 3; among these signed graphs,there are two classes of ...
Wang, Dijian, Hou, Yaoping
core +1 more source
Ordering signed graphs with large index [PDF]
, 2022 The index of a signed graph is the largest eigenvalue of its adjacency matrix. We establish the first few signed graphs ordered decreasingly by the index in classes of connected signed graphs, connected unbalanced signed graphs and complete signed graphs
Brunetti M, Stanic Z
core +1 more source
Inertias of Laplacian matrices of weighted signed graphs
Special Matrices, 2019 We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia.
Monfared K. Hassani +3 more
doaj +1 more source
On $bullet$-lict signed graphs $L_{bullet_c}(S)$ and $bullet$-line signed graphs $L_bullet(S)$ [PDF]
Transactions on Combinatorics, 2016 A emph{signed graph} (or, in short, emph{sigraph}) $S=(S^u,sigma)$ consists of an underlying graph $S^u :=G=(V,E)$ and a function $sigma:E(S^u)longrightarrow {+,-}$, called the signature of $S$. A emph{marking} of $S$ is a function $mu:V(S)longrightarrow
Mukti Acharya +2 more
doaj
Smarandachely antipodal signed digraphs [PDF]
, 2010 For standard terminology and notion in digraph theory, we refer the reader to the classic text-books of Bondy and Murty [1] and Harary et al.[3]; the non-standard will be given in this paper as and when ...
Salestina, M. Ruby +5 more
core +1 more source
Walks and eigenvalues of signed graphs
Special Matrices, 2023 In this article, we consider the relationships between walks in a signed graph G˙\dot{G} and its eigenvalues, with a particular focus on the largest absolute value of its eigenvalues ρ(G˙)\rho \left(\dot{G}), known as the spectral radius.
Stanić Zoran
doaj +1 more source