Search references for SHRIKHANDE GRAPH. Phrases containing SHRIKHANDE GRAPH
See searches and references containing SHRIKHANDE GRAPH!SHRIKHANDE GRAPH
Undirected graph named after S. S. Shrikhande
mathematical field of graph theory, the Shrikhande graph is a graph discovered by S. S. Shrikhande in 1959. It is a strongly regular graph with 16 vertices
Shrikhande_graph
Indian mathematician (1917–2020)
squares of order 4n + 2 for any n. Shrikhande's specialties were combinatorics and statistical designs. The Shrikhande graph is used in statistical design
Sharadchandra Shankar Shrikhande
Sharadchandra_Shankar_Shrikhande
Graph of chess rook moves
strongly regular graph, the Shrikhande graph, with the same parameters as the 4 × 4 {\displaystyle 4\times 4} rook's graph. The Shrikhande graph obeys the same
Rook's_graph
Graph representing edges of another graph
its parameters with the Shrikhande graph. When both sides of the bipartition have the same number of vertices, these graphs are again strongly regular
Line_graph
Concept in graph theory
coincide with those of the Shrikhande graph, but the two graphs are not isomorphic. (The vertex neighborhood for the Shrikhande graph is a hexagon, while that
Strongly_regular_graph
Mapping a graph onto itself without changing edge-vertex connectivity
In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving
Graph_automorphism
graph Cameron graph Petersen graph Hall–Janko graph Hoffman–Singleton graph Higman–Sims graph Paley graph of order 13 Shrikhande graph Schläfli graph
List_of_graphs
Graph where any two nodes of equal distance are isomorphic
graphs that are distance-regular but not distance-transitive. The smallest distance-regular graph that is not distance-transitive is the Shrikhande graph
Distance-transitive_graph
the Shrikhande graph. It can be visualized as net, a 4 by 4 array of hexagons, where left-right and top-bottom wrap into a flat torus. The Dyck graph is
Dyck_graph
the graph is planar and F indicates that the graph is not planar. Wikimedia Commons has media related to Graphs by number of vertices. See also Graph theory
List of graphs by edges and vertices
List_of_graphs_by_edges_and_vertices
the Shrikhande graph and the Hoffman graph are integral. A regular graph is periodic if and only if it is an integral graph. A walk-regular graph that
Integral_graph
Shrikhande – Is an Indian mathematician with distinguished and well-recognized achievements in combinatorial mathematics, known for Shrikhande graph M
List of Marathi people in science, engineering and technology
List_of_Marathi_people_in_science,_engineering_and_technology
Describing a family of graphs by excluding certain (sub)graphs
S2CID 9173731 Naik, Ranjan N.; Rao, S. B.; Shrikhande, S. S.; Singhi, N. M. (1982), "Intersection graphs of k-uniform hypergraphs", European Journal
Forbidden graph characterization
Forbidden_graph_characterization
Generalization of line graphs to hypergraphs
characterization of Krausz type for the line graphs of k-uniform linear hypergraphs for any k ≥ 3 was given by Naik, Rao, Shrikhande, and Singhi. At the same time,
Line_graph_of_a_hypergraph
exceptions, every line graph of a complete graph is uniquely determined by its parameters as a strongly regular graph. Shrikhande graph, a similar exception
Chang_graphs
Indian inventions
Indian math student S. P. Sundaram. Shrikhande graph – Graph invented by the Indian mathematician S.S. Shrikhande in 1959. Standard monomial theory, C
List of Indian inventions and discoveries
List_of_Indian_inventions_and_discoveries
Indian mathematician (1938–2009)
dissertation Some New Results in PBIBD Designs and Combinatorics. S. S. Shrikhande was her advisor. After completing her doctorate, she remained on the faculty
Vasanti_N._Bhat-Nayak
In graph theory, a b-coloring of a graph is a coloring of the vertices where each color class contains a vertex that has a neighbor in all other color
B-coloring
Virginia (1990–1992). Sharadchandra Shankar Shrikhande, 102, Indian mathematician, developer of Shrikhande graph. Milt Sunde, 78, American football player
Deaths_in_April_2020
Indian mathematician (born 1949)
earned a Ph.D. (1974) from the University of Mumbai, his advisor was S. S. Shrikhande. Professor Singhi is a Fellow of the Indian National Science Academy.
Navin_M._Singhi
Indian American mathematician and statistician (1901-1987)
graph and started a systematic study of difference sets to construct symmetric block designs. He was notable for his work along with S. S. Shrikhande
Raj_Chandra_Bose
Indian mathematician (born 1943)
completing his Ph.D., he moved to the University of Mumbai to work with S. S. Shrikhande. At the same time, he visited King's College, Aberdeen to work with Crispin
S._B._Rao
Mathematical problem
important work in combinatorics. In early 1959, Raj Chandra Bose and S. S. Shrikhande constructed some counterexamples (dubbed the Euler spoilers) of order
Mutually orthogonal Latin squares
Mutually_orthogonal_Latin_squares
Indian university and research institute
Sharadchandra Shankar Shrikhande joined the institute as its director in January 1983. The institute was facing financial difficulties, and Shrikhande sought DAE
Harish-Chandra Research Institute
Harish-Chandra_Research_Institute
for any oddly even number n ≡ 2 (mod 4). In 1959, R. C. Bose and S. S. Shrikhande constructed counterexamples of order 22. Then E. T. Parker found a counterexample
List_of_incomplete_proofs
Symmetric arrangement of finite sets
ISBN 978-0-88385-000-8 {{citation}}: ISBN / Date incompatibility (help) Shrikhande, S.S.; Bhat-Nayak, Vasanti N. (1970), "Non-isomorphic solutions of some
Combinatorial_design
Structure in combinatorial mathematics
51 (2): 4434–4450. doi:10.1080/03610926.2020.1814816. S2CID 225335042. Shrikhande, S.S.; Bhat-Nayak, Vasanti N. (1970), "Non-isomorphic solutions of some
Block_design
travel, tourism, insurance
SHRIKHANDE GRAPH
SHRIKHANDE GRAPH
SHRIKHANDE GRAPH
SHRIKHANDE GRAPH
SHRIKHANDE GRAPH
SHRIKHANDE GRAPH
SHRIKHANDE GRAPH
SHRIKHANDE GRAPH
SHRIKHANDE GRAPH
travel, tourism, insurance