On the existence of semigraphs and complete semigraphs with given parameters
E. Sampathkumar has generalized a graph to a semigraph by allowing an edge to have more than two vertices. Like in the case of graphs, a complete semigraph is a semigraph in which every two vertices are adjacent to each other. In this article, we have generalized a problem noted by Gauss in 1796 abo...
Guardado en:
Autores principales: | Jyoti Shetty, G. Sudhakara, Vinay Madhusudanan |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/6539e4e600cc43f7bdc829b890084089 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Relating graph energy with vertex-degree-based energies
por: Ivan Gutman
Publicado: (2020) -
Even vertex equitable even labeling for snake related graphs
por: Lourdusamy,A., et al.
Publicado: (2019) -
On topological properties of hierarchical hypercube network based on Ve and Ev degree
por: Zahra Nida, et al.
Publicado: (2021) -
Graphs of edge-to-vertex detour number 2
por: Santhakumaran,A. P.
Publicado: (2021) -
A Complete Characterisation of Vertex-multiplications of Trees with Diameter 5
por: Willie Wong, et al.
Publicado: (2021)