Non-isomorphic graphs with cospectral symmetric powers.
Barghi, Amir Rahnamai, Ponomarenko, Ilya (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A Smooth Four-Dimensional G-Hilbert Scheme”
Non-isomorphic graphs with cospectral symmetric powers.
The remarkable generalized Petersen graph
Dragan Marušič, Tomaž Pisanski (2000)
Mathematica Slovaca
Similarity:
The periphery graph of a median graph
Boštjan Brešar, Manoj Changat, Ajitha R. Subhamathi, Aleksandra Tepeh (2010)
Discussiones Mathematicae Graph Theory
Similarity:
The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a universal vertex can be realized as the periphery graph of a median graph. We characterize those median graphs whose periphery graph is the join of two graphs and show that they are precisely Cartesian products of median graphs. Path-like median graphs are introduced as the graphs whose periphery graph has independence number 2, and it is proved that there are...
Separability number and Schurity number of coherent configurations.
Evdokimov, Sergei, Ponomarenko, Ilia (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on the graph equation .
Simić, Slobodan K. (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
A note on randomly complete -partite graphs
Pavol Híc (1992)
Mathematica Slovaca
Similarity:
Pₘ-saturated bipartite graphs with minimum size
Aneta Dudek, A. Paweł Wojda (2004)
Discussiones Mathematicae Graph Theory
Similarity:
A graph G is said to be H-saturated if G is H-free i.e., (G has no subgraph isomorphic to H) and adding any new edge to G creates a copy of H in G. In 1986 L. Kászonyi and Zs. Tuza considered the following problem: for given m and n find the minimum size sat(n;Pₘ) of Pₘ-saturated graph of order n. They gave the number sat(n;Pₘ) for n big enough. We deal with similar problem for bipartite graphs.