Results 41 to 50 of about 735,632 (298)

On $bullet$-lict signed graphs $L_{bullet_c}(S)$ and $bullet$-line signed graphs $L_bullet(S)$ [PDF]

open access: yesTransactions 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  

Inertias of Laplacian matrices of weighted signed graphs

open access: yesSpecial 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

Negation switching invariant signed graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2014
A signed graph (or, $sigraph$ in short) is a graph G in which each edge x carries a value $\sigma(x) \in \{-, +\}$ called its sign. Given a sigraph S, the negation $\eta(S)$ of the sigraph S is a sigraph obtained from S by reversing the sign of every ...
Deepa Sinha, Ayushi Dhama
doaj   +1 more source

Walks and eigenvalues of signed graphs

open access: yesSpecial 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

More on signed graphs with at most three eigenvalues [PDF]

open access: yes, 2021
We consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at least one simple eigenvalue, and (ii) those with vertexdeleted subgraphs which themselves have at most 3 distinct eigenvalues. We also construct new examples
StaniĆ, Zoran   +10 more
core   +2 more sources

Research on Extreme Signed Graphs with Minimal Energy in Tricyclic Signed Graphs S(n, n + 2)

open access: yesComplexity, 2020
A signed graph is acquired by attaching a sign to each edge of a simple graph, and the signed graphs have been widely used as significant computer models in the study of complex systems.
Yajing Wang, Yubin Gao
doaj   +1 more source

Offensive Alliances in Signed Graphs [PDF]

open access: yes, 2023
Signed graphs have been introduced to enrich graph structures expressing relationships between persons or general social entities, introducing edge signs to reflect the nature of the relationship, e.g., friendship or enmity.
Qi, Xingqin   +3 more
core   +1 more source

Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs

open access: yesAlgorithms, 2021
This paper studies the maximum-clique independence problem and some variations of the clique transversal problem such as the {k}-clique, maximum-clique, minus clique, signed clique, and k-fold clique transversal problems from algorithmic aspects for k ...
Chuan-Min Lee
doaj   +1 more source

Salmonella lipopolysaccharide‐containing supported lipid bilayers as platforms to study bacteriophage interactions

open access: yesFEBS Letters, EarlyView.
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace   +6 more
wiley   +1 more source

Laplacian Spectral Characterization of Signed Sun Graphs

open access: yesTheory and Applications of Graphs, 2023
A sun SGn is a graph of order 2n consisting of a cycle Cn, n ≥ 3, to each vertex of it a pendant edge is attached. In this paper, we prove that unbalanced signed sun graphs are determined by their Laplacian spectra.
Fatemah Motialah   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy