Showing 1 - 16 results of 16 for search '"Regular graph"', query time: 0.04s Refine Results
  1. 1
    AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {25; 16; 1; 1; 8; 25}

    AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {25; 16; 1; 1; 8; 25} by Konstantin S. Efimov, Alexander A. Makhnev

    Published 2017-07-01
    Subjects: “…Strongly regular graph, Distance-regular graph…”
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}

    AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36} by Konstantin S. Efimov, Aleksandr A. Makhnev

    Published 2018-12-01
    Subjects: “…Strongly regular graph, Distance-regular graph…”
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    4-REGULAR GRAPH OF DIAMETER 2

    4-REGULAR GRAPH OF DIAMETER 2 by Đỗ Như An, Nguyễn Đình Ái

    Published 2013-06-01
    Subjects: “…Regular graph…”
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\)

    ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\) by Alexander A. Makhnev, Ivan N. Belousov, Konstantin S. Efimov

    Published 2022-12-01
    Subjects: “…strongly regular graph, distance-regular graph, intersection array…”
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    GRAPHS \(\Gamma\) OF DIAMETER 4 FOR WHICH \(\Gamma_{3,4}\) IS A STRONGLY REGULAR GRAPH WITH \(\mu=4,6\)

    GRAPHS \(\Gamma\) OF DIAMETER 4 FOR WHICH \(\Gamma_{3,4}\) IS A STRONGLY REGULAR GRAPH WITH \(\mu=4,6\) by Alexander A. Makhnev, Mikhail P. Golubyatnikov, Konstantin S. Efimov

    Published 2024-07-01
    Subjects: “…distance-regular graph, strongly regular graph, triple intersection numbers…”
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {27, 20, 7; 1, 4, 21} DOES NOT EXIST

    DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {27, 20, 7; 1, 4, 21} DOES NOT EXIST by Konstantin S. Efimov, Alexander A. Makhnev

    Published 2020-12-01
    Subjects: “…distance-regular graph, graph \(\gamma\) with strongly regular graph \(\gamma_3\), automorphism…”
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    A regular graph of girth 6 and valency 11

    A regular graph of girth 6 and valency 11 by P. K. Wong

    Published 1986-01-01
    Subjects: “…regular graph…”
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    On Automorphisms of a Distance-Regular Graph with Intersection Array {125,96,1;1,48,125}

    On Automorphisms of a Distance-Regular Graph with Intersection Array {125,96,1;1,48,125} by V.V. Bitkina, A.A. Makhnev

    Published 2017-03-01
    Subjects: “…distance-regular graph…”
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    SHILLA GRAPHS WITH \(b=5\) AND \(b=6\)

    SHILLA GRAPHS WITH \(b=5\) AND \(b=6\) by Alexander A. Makhnev, Ivan N. Belousov

    Published 2021-12-01
    Subjects: “…shilla graph, distance-regular graph, q-polynomial graph.…”
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH

    CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH by Nhu An Do, Quang Tuan Nguyen

    Published 2024-02-01
    Subjects:
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    ON \(G\)-VERTEX-TRANSITIVE COVERS OF COMPLETE GRAPHS HAVING AT MOST TWO \(G\)-ORBITS ON THE ARC SET

    ON \(G\)-VERTEX-TRANSITIVE COVERS OF COMPLETE GRAPHS HAVING AT MOST TWO \(G\)-ORBITS ON THE ARC SET by Ludmila Yu. Tsiovkina

    Published 2024-07-01
    Subjects: “…antipodal cover, distance-regular graph, vertex-transitive graph, arc-transitive graph…”
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    On comparison between the distance energies of a connected graph

    On comparison between the distance energies of a connected graph by Hilal A. Ganie, Bilal Ahmad Rather, Yilun Shang

    Published 2024-11-01
    Subjects:
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    ON SOME VERTEX-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS

    ON SOME VERTEX-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS by Ludmila Yu. Tsiovkina

    Published 2022-12-01
    Subjects: “…distance-regular graph, antipodal cover, abelian cover, vertex-transitive graph, rank 3 group…”
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    On Strongly Regular Graphs and the Friendship Theorem

    On Strongly Regular Graphs and the Friendship Theorem by Igal Sason

    Published 2025-03-01
    Subjects:
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    ON A CLASS OF EDGE-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS

    ON A CLASS OF EDGE-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS by Ludmila Yu. Tsiovkina

    Published 2021-12-01
    Subjects: “…distance-regular graph, antipodal cover, geodetic graph, arc-transitive graph, edge-transitive graph, 2-transitive group, 2-homogeneous group.…”
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    New Karhunen-Loève expansions based on Hahn polynomials with application to a Sobolev test for uniformity on Johnson graphs

    New Karhunen-Loève expansions based on Hahn polynomials with application to a Sobolev test for uniformity on Johnson graphs by Pycke, Jean-Renaud

    Published 2024-09-01
    Subjects:
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: