Results 91 to 100 of about 1,304 (147)

On spectrum and energies of enhanced power graphs

open access: yesMathematics Open
The enhanced power graph [Formula: see text] of a group G is a simple graph with vertex set G and two distinct vertex are adjacent if and only if they belong to the same cyclic subgroup.
Pankaj Kalita, Prohelika Das
doaj   +1 more source

Representation learning of in-degree-based digraph with rich information

open access: yesComplex & Intelligent Systems
Network representation learning aims to map the relationship between network nodes and context nodes to a low-dimensional representation vector space. Directed network representation learning considers mapping directional of node vector.
Yan Sun   +4 more
doaj   +1 more source

Some sufficient conditions on hamilton graphs with toughness. [PDF]

open access: yesFront Comput Neurosci, 2022
Cai G, Yu T, Xu H, Yu G.
europepmc   +1 more source

The Aα-Spectral Radii of Graphs with Given Connectivity

open access: yesMathematics, 2019
The A α -matrix is A α ( G ) = α D ( G ) + ( 1 − α ) A ( G ) with α ∈ [ 0 , 1 ] , given by Nikiforov in 2017, where A ( G ) is adjacent matrix, and D ( G ) is its ...
Chunxiang Wang, Shaohui Wang
doaj   +1 more source

Signless laplacian spectral characterization of roses

open access: yesKuwait Journal of Science, 2020
A p-rose graph Γ = RG(a3, a4, . . . , as) is a graph consisting of p =a3 + a4 + · · · + as ≥ 2 cycles that all meet in one vertex, and ai (3 ≤ i ≤ s) is the number of cycles in Γ of length i.
ALI ZEYDI ABDIAN   +2 more
doaj  

Home - About - Disclaimer - Privacy