On graphs in which the neighborhood of each vertex is the complementary graph of a seidel graph

ISSN： 1064-5624

Source： Doklady Mathematics, Vol.82, Iss.2, 2010-10, pp. : 762-764

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Distributed Graphs and Graph Transformation

By Taentzer G.

Applied Categorical Structures, Vol. 7, Iss. 4, 1999-12 ,pp. : 431-462

Springer Publishing Company

Access to resources Recommend Favorite

Partitioning a graph into vertex-disjoint paths

By Li Jianping Steiner George

Studia Scientiarum Mathematicarum Hungarica, Vol. 42, Iss. 3, 2005-08 ,pp. : 277-294

Akademiai Kiado

Access to resources Recommend Favorite

Efficiently searching a graph by a smell-oriented vertex process

By Wagner Israel

Annals of Mathematics and Artificial Intelligence, Vol. 24, Iss. 1-4, 1998-02 ,pp. : 211-223

Springer Publishing Company

Access to resources Recommend Favorite

Petersen Graph Decompositions of Complete Multipartite Graphs

By Wang Jinhua Ma Dengju

Graphs and Combinatorics, Vol. 26, Iss. 5, 2010-09 ,pp. : 737-744

Springer Publishing Company

Access to resources Recommend Favorite

Vertex Distinguishing Equitable Total Chromatic Number of Join Graph

By Wang Zhi-wen

Acta Mathematicae Applicatae Sinica, Vol. 23, Iss. 3, 2007-07 ,pp. : 433-438

Springer Publishing Company

Access to resources Recommend Favorite