Results 241 to 250 of about 79,461 (254)
Some of the next articles are maybe not open access.
Laplacian borderenergetic graphs
Journal of Information and Optimization Sciences, 2019The graph G of order n is said to be Laplacian (signless Laplacian) borderenergetic if its Laplacian (signless Laplacian) energy equals the Laplacian (signless Laplacian) energy of the complete gra...
Mardjan Hakimi-Nezhaad +1 more
openaire +1 more source
2017
In this chapter, we are interested in exploring questions such as the following. If a group G acts on a graph \(\Gamma \), what is the relationship between the spectrum of \(\Gamma \) and the spectrum of the quotient \(\Gamma /G\)?
W. David Joyner, Caroline Grant Melles
openaire +1 more source
In this chapter, we are interested in exploring questions such as the following. If a group G acts on a graph \(\Gamma \), what is the relationship between the spectrum of \(\Gamma \) and the spectrum of the quotient \(\Gamma /G\)?
W. David Joyner, Caroline Grant Melles
openaire +1 more source
Graph Embeddings and Laplacian Eigenvalues
SIAM Journal on Matrix Analysis and Applications, 2000Summary: Graph embeddings are useful in bounding the smallest nontrivial eigenvalues of Laplacian matrices from below. For an \(n \times n\) Laplacian, these embedding methods can be characterized as follows: The lower bound is based on a clique embedding into the underlying graph of the Laplacian. An embedding can be represented by a matrix \(\Gamma\);
Guattery, Stephen, Miller, Gary L.
openaire +1 more source
GRAPHS CHARACTERIZED BY LAPLACIAN EIGENVALUES
Chinese Annals of Mathematics, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Laplacian Eigenvectors of Graphs
2007[No abstract available] Publisher's ...
Türker Biyikoğu +2 more
openaire +3 more sources
Deformed Graph Laplacian for Semisupervised Learning
IEEE Transactions on Neural Networks and Learning Systems, 2015Graph Laplacian has been widely exploited in traditional graph-based semisupervised learning (SSL) algorithms to regulate the labels of examples that vary smoothly on the graph. Although it achieves a promising performance in both transductive and inductive learning, it is not effective for handling ambiguous examples (shown in Fig. 1).
Chen, Gong +5 more
openaire +2 more sources
Graphs and Associated Laplacians
2012In this chapter, we provide the necessary notation and basic results on spectral graph theory needed in the subsequent chapters. Results on spectral theory of combinatorial Laplacians can be found e.g. in [Do84, MW89, CdV98, CGY96, Chu97, HS99, Sh00, HS04, Su08].
openaire +1 more source