Results 1 to 10 of about 1,324,556 (299)
Determining Graphs by the Complementary Spectrum
The complementary spectrum of a connected graph G is the set of the complementary eigenvalues of the adjacency matrix of G. In this note, we discuss the possibility of representing G using this spectrum.
Pinheiro Lucélia K. +2 more
doaj +3 more sources
Restrained Domination in Self-Complementary Graphs
A self-complementary graph is a graph isomorphic to its complement. A set S of vertices in a graph G is a restrained dominating set if every vertex in V(G) \ S is adjacent to a vertex in S and to a vertex in V(G) \ S.
Desormeaux Wyatt J. +2 more
doaj +5 more sources
Local coloring of self complementary graphs
Let be a graph. A local coloring of a graph of order at least 2 is a function having the property that for each set with , there exist vertices such that , where is the size of the induced subgraph .
P. Deepa +2 more
doaj +2 more sources
A Multimodal Representation Learning Framework for Molecular Graph and NMR Spectrum Alignment [PDF]
Accurate matching between molecular structures and NMR spectra is an important task in automated structure elucidation. However, existing methods still face difficulties in jointly modeling multi-scale molecular topology and effectively exploiting the ...
Xiao Li +4 more
doaj +2 more sources
Certain classes of complementary equienergetic graphs [PDF]
The energy of a graph is the sum of the absolute values of the eigenvalues of a graph. Two graphs are said to be equienergetic if they have same energy.
Harishchandra Ramane +2 more
doaj +1 more source
Local Antisymmetric Connectedness in Asymmetrically Normed Real Vector Spaces
In this paper, some properties of locally antisymmetrically connected spaces which are the localized version of the antisymmetrically connected $T_0$-quasi-metric spaces constructed as the natural counterparts of connected complementary graphs, are ...
Nezakat Javanshır, Filiz Yıldız
doaj +1 more source
The Spectrum of Weighted Lexicographic Product on Self-Complementary Graphs
The lexicographic product, a powerful binary operation in graph theory, offers methods for creating a novel graph by establishing connections between each vertex of one graph and every vertex of another.
Xiaoxiao Zhang, Zenghui Fang
doaj +1 more source
On graphs with α- and b-edge consecutive edge magic labelings
Among the most studied graph labelings we have the varieties called alpha and edge-magic. Even when their definitions seem completely different, these labelings are related.
Christian Barrientos
doaj +1 more source
Exploration of CPCD number for power graph
Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in is either a pendent vertex or a support vertex and ...
S. Anuthiya, G. Mahadevan, C. Sivagnanam
doaj +1 more source
Equienergetic self-complementary graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Indulal, G., Vijayakumar, A.
openaire +1 more source

