Results 1 to 10 of about 5,185,958 (306)
Some of the next articles are maybe not open access.
IEEE Transactions on Information Forensics and Security, 2023
Deep learning (DL) greatly enhances binary anomaly detection capabilities through effective statistical network characterization; nevertheless, the intrusion class differentiation performance is still insufficient.
Guanghan Duan +3 more
semanticscholar +1 more source
Deep learning (DL) greatly enhances binary anomaly detection capabilities through effective statistical network characterization; nevertheless, the intrusion class differentiation performance is still insufficient.
Guanghan Duan +3 more
semanticscholar +1 more source
JOM, 2022
Machine learning (ML)-based models have greatly enhanced the traditional materials discovery and design pipeline. Specifically, in recent years, surrogate ML models for material property prediction have demonstrated success in predicting discrete scalar ...
Prathik R. Kaundinya +2 more
semanticscholar +1 more source
Machine learning (ML)-based models have greatly enhanced the traditional materials discovery and design pipeline. Specifically, in recent years, surrogate ML models for material property prediction have demonstrated success in predicting discrete scalar ...
Prathik R. Kaundinya +2 more
semanticscholar +1 more source
On Sombor indices of line graph of silicate carbide Si 2 C 3-I[p,q]
Journal of Discrete Mathematical Sciences and Cryptography, 2022Topological indices are numerical parameters associated with underlying topology of a molecular structure. They are correlated with several physio-chemical properties of chemical compounds.
Fatima Asif +6 more
semanticscholar +1 more source
The first zagreb index and some hamiltonian properties of the line graph of a graph
Journal of Discrete Mathematical Sciences and Cryptography, 2017Rao Li
exaly +2 more sources
Graphs and Combinatorics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhaohong Niu, Liming Xiong
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhaohong Niu, Liming Xiong
openaire +2 more sources
Hypergraph Attention Isomorphism Network by Learning Line Graph Expansion
2020 IEEE International Conference on Big Data (Big Data), 2020Graph neural networks (GNNs) are able to achieve state-of-the-art performance for node representation and classification in a network. But, most of the existing GNNs can be applied to simple graphs, where an edge connects only a pair of nodes.
S. Bandyopadhyay, Kishalay Das, M. Murty
semanticscholar +1 more source
Discrete Mathematics, 2022
A connected graph is said to be supereulerian if it containes a spanning Eulerian subgraph. The interest in these graphs comes from the fact that such a graph has a Hamiltonian line graph. A graph \(G\) is called essentially \(k\)-edge connected if \(G\) does not have an essential edge cut \(X\) with \(|X| < k.\) The main results of this paper ...
Yingmin Shangguan, Liming Xiong
openaire +1 more source
A connected graph is said to be supereulerian if it containes a spanning Eulerian subgraph. The interest in these graphs comes from the fact that such a graph has a Hamiltonian line graph. A graph \(G\) is called essentially \(k\)-edge connected if \(G\) does not have an essential edge cut \(X\) with \(|X| < k.\) The main results of this paper ...
Yingmin Shangguan, Liming Xiong
openaire +1 more source
Collapsible Graphs and Hamiltonicity of Line Graphs
Graphs and Combinatorics, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Weihua +3 more
openaire +3 more sources
Graphs and Combinatorics, 1994
``For integers \(k \geq 2\), the \(k\)-line graph of a graph \(G\) is defined as a graph whose vertices correspond to the complete subgraphs on \(k\) vertices in \(G\) with two distinct vertices adjacent if the corresponding complete subgraphs have \(k-1\) common vertices in \(G\).'' Starting with a graph \(G\), one can construct the sequence of graphs
Van Bang Le, Erich Prisner
openaire +2 more sources
``For integers \(k \geq 2\), the \(k\)-line graph of a graph \(G\) is defined as a graph whose vertices correspond to the complete subgraphs on \(k\) vertices in \(G\) with two distinct vertices adjacent if the corresponding complete subgraphs have \(k-1\) common vertices in \(G\).'' Starting with a graph \(G\), one can construct the sequence of graphs
Van Bang Le, Erich Prisner
openaire +2 more sources
Journal of Graph Theory, 1984
AbstractWe give best possible Ore‐like conditions for a graph so that its line graph is Hamiltonian.
openaire +2 more sources
AbstractWe give best possible Ore‐like conditions for a graph so that its line graph is Hamiltonian.
openaire +2 more sources