Graphs having planar complementary line (total) graphs.
Graph equations for line graphs and n-th distance graphs.
A note on the graph equation .
On the largest eigenvalue of bicyclic graphs.
Non-complete extended -sum of graphs, graph angles and star partitions.
Some remarks on integral graphs with maximum degree four.
On The Decomposition Of The Line (Total) Graphs With Respct To Some Binary Operations
Graphs Which Are Switching Equivalent To Their Complementary Line Graphs II
Graphs Which Are Switching Equivalent To Their Complementary Line Graphs I
An Algorithm To Recognize A Generalized Line Graph And Output It's Root Graph
Graph Equations For Line Graphs And The N-Th Power Graphs I
Some graphs with extremal Szeged index
Some remarks on the complement of a line graph
On the Largest Eigenvalue of Unicyclic Graphs
Complementary Pairs of Graphs With the Second Largest Eigenvalue not Exceeding (sqrt(5)-1)/2
Graphs Which Are Switching Equivalent To Their Line Graphs
Eigenvalue Bounds for the Signless Laplacian
On the Largest Eigenvalue of some Homeomorphic Graphs
TOWARDS A SPECTRAL THEORY OF GRAPHS BASED ON THE SIGNLESS LAPLACIAN, I
Some additions to the theory of star partitions of graphs
This paper contains a number of results in the theory of star partitions of graphs. We illustrate a variety of situations which can arise when the Reconstruction Theorem for graphs is used, considering in particular galaxy graphs - these are graphs in which every star set is independent. We discuss a recursive ordering of graphs based on the Reconstruction Theorem, and point out the significance of galaxy graphs in this connection.
Page 1 Next