Results 301 to 310 of about 926,750 (319)
Some of the next articles are maybe not open access.
Fuzzy k-Competition Graphs and p-Competition Fuzzy Graphs
Fuzzy Information and Engineering, 2013Sovan Samanta, Madhumangal Pal
exaly
On the toughness of the middle graph of a graph.
Ars Comb., 2001The middle graph \(M(G)\) of a graph is the graph obtained from \(G\) by inserting a new vertex into every edge of \(G\) and by joining by edges those pairs of these new vertices which lie on adjacent edges of \(G\). Let \(\omega (G-S)\) be the number of connected components of the graph \(G-S\) obtained from a graph \(G\) by deleting a subset \(S\) of
openaire +1 more source
A (sub)graph isomorphism algorithm for matching large graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004L P Cordella +2 more
exaly
Which graphs are determined by their spectrum?
Linear Algebra and Its Applications, 2003Edwin R Van Dam, Willem H Haemers
exaly
On the Zagreb indices of the line graphs of the subdivision graphs
Applied Mathematics and Computation, 2011V Lokesha, Ismail Naci Cangül
exaly
Constructing knowledge graphs and their biomedical applications
Computational and Structural Biotechnology Journal, 2020David N Nicholson, Casey S Greene
exaly

