Graphs which are switching equivalent to their complementary line graphs I.
Graphs Which Are Switching Equivalent To Their Line Graphs
Graphs which are switching equivalent to their line graphs.
Graphs which have pancyclic complements.
Graphs with extremal Randić index when the minimum degree of vertices is two
Graphs with given subgraphs represent all categories
Graphs with given subgraphs represent all categories. II.
Graphs with nonisomorphic vertex neighbourhoods of the first and second types
Graphs with prescribed maximal subgraphs and critical chromatic graphs
Greatest common subgraphs of graphs
Green functions on self-similar graphs and bounds for the spectrum of the laplacian
Combining the study of the simple random walk on graphs, generating functions (especially Green functions), complex dynamics and general complex analysis we introduce a new method for spectral analysis on self-similar graphs.First, for a rather general, axiomatically defined class of self-similar graphs a graph theoretic analogue to the Banach fixed point theorem is proved. The subsequent results hold for a subclass consisting of “symmetrically” self-similar graphs which however is still more general then...
Groups and polar graphs