Results 91 to 100 of about 86,434 (167)

Graph Configurations and Independent Bondage Numbers of Planar Graphs

open access: yes
The independent domination number of a finite graph G is the minimum cardinality of an independent dominating set of vertices. The independent bondage number of G is the minimum cardinality of a set of edges whose deletion results in a graph with a larger independent domination number than that of G.
Gamlath, E. G. K. M.   +2 more
openaire   +1 more source

Graph-based federated learning approach for intrusion detection in IoT networks. [PDF]

open access: yesSci Rep
Al Tfaily F   +5 more
europepmc   +1 more source

Extending the range of graph neural networks with global encodings. [PDF]

open access: yesNat Commun
Caruso A   +6 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy