The following pages link to (Q3907599):
Displaying 50 items.
- On the characteristic polynomial of the power of a path. (Q4691305) (← links)
- Graphs whose energy does not exceed 3 (Q4723773) (← links)
- Two Necessary Conditions for λ 2 (G) = d 2 ( G ) (Q4804462) (← links)
- Characteristic polynomials of multi-index transportation problems (Q4809624) (← links)
- Inert matrices and matchings in partially oriented trees (Q4809643) (← links)
- Construction of L-equienergetic graphs using some graph operations (Q4956185) (← links)
- (Q4957143) (← links)
- Constructions of new integral graph families (Q4958061) (← links)
- Complex adjacency spectra of digraphs (Q4965582) (← links)
- Harary spectrum of generalized composition of graphs and Harary equienergetic graphs (Q4971841) (← links)
- On skew Laplacian spectrum and energy of digraphs (Q4985490) (← links)
- Extremal iota energy of a subclass of bicyclic digraphs and sidigraphs (Q4985563) (← links)
- On the Laplacian Szeged Spectrum of Paths (Q4988478) (← links)
- Eigenvalues and triangles in graphs (Q4993261) (← links)
- Perfect colorings of regular graphs (Q4998739) (← links)
- Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization (Q4999399) (← links)
- (Q4999931) (← links)
- Correlation between the continuous-time quantum walk and cliques in graphs and its application (Q5003363) (← links)
- (Q5003752) (← links)
- On energy, Laplacian energy and p-fold graphs (Q5006557) (← links)
- Reciprocal Complementary Distance Spectra and Reciprocal Complementary Distance Energy of Line Graphs of Regular Graphs (Q5006569) (← links)
- Weighted graphs: Eigenvalues and chromatic number (Q5006571) (← links)
- Spectra of the extended neighborhood corona and extended corona of two graphs (Q5006579) (← links)
- Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs (Q5006611) (← links)
- The cycle (circuit) polynomial of a graph with double and triple weights of edges and cycles (Q5009945) (← links)
- Bounds for graph energy in terms of vertex covering and clique numbers (Q5009956) (← links)
- (Q5016633) (← links)
- Spectrum and L-spectrum of the power graph and its main supergraph for certain finite groups (Q5019634) (← links)
- Spectra of M-rooted product of graphs (Q5023592) (← links)
- Proof of a conjecture on spectral distance between cycles, paths and certain trees (Q5025150) (← links)
- Consecutive chemical trees with respect to energy of graph (Q5034962) (← links)
- On spectrum of a graph given by color Harary matrix (Q5034992) (← links)
- On Distance Signless Laplacian Estrada Index and Energy of Graphs (Q5035247) (← links)
- Construction of L-Borderenergetic Graphs (Q5035249) (← links)
- On spectral spread of generalized distance matrix of a graph (Q5043667) (← links)
- On the eigenvalues of closed shadow graphs (Q5043955) (← links)
- Some chemical indices related to the number of triangles (Q5045987) (← links)
- On distance signless Laplacian spectrum of graphs and spectrum of zero divisor graphs of ℤ<sub>n</sub> (Q5049198) (← links)
- An Improved Lower Bound for the Degree Kirchhoff Index of Bipartite Graphs (Q5051424) (← links)
- Computing the dependence of graph energy on nullity: The method of siblings (Q5051438) (← links)
- Bounds on graph energy and Randic energy (Q5051447) (← links)
- On the generalized adjacency spectral radius of digraphs (Q5051482) (← links)
- A NOTE ON THE SINGULARITY OF ORIENTED GRAPHS (Q5053453) (← links)
- Characterization of strongly regular integral circulant graphs by spectral approach (Q5054087) (← links)
- On maximum degree (signless) Laplacian matrix of a graph (Q5054108) (← links)
- On the Permanental Polynomial and Permanental Sum of Signed Graphs (Q5054779) (← links)
- List coloring under some graph operations (Q5059492) (← links)
- Quiver asymptotics: N=1 free chiral ring (Q5060406) (← links)
- On the Aα-spectrum of joined union of digraphs (Q5063253) (← links)
- On the spectral radius, energy and Estrada index of the arithmetic–geometric matrix of a graph (Q5063288) (← links)
