16-vertex graphs with automorphism groups A4 and A5 from the icosahedron

16-vertex graphs with automorphism groups A4 and A5 from the icosahedron

The article deals with the problem of finding vertex-minimal graphs with a given automorphism group. We exhibit two undirected 16-vertex graphs having automorphism groups A4 and A5. It improves Babai's bound for A4 and the graphical regular representation bound for A5. The graphs are constructe...

Повний опис

Збережено в:

Бібліографічні деталі
Автор:	Daugulis, Peteris; Institute of Life Sciences and Technologies Daugavpils University, Parades 1, Daugavpils, Latvia (Автор)
Формат:	EJournal Article
Опубліковано:	GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2020-10-15.
Предмети:	info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion Peer-reviewed Article
Онлайн доступ:	Get Fulltext
Теги:	Додати тег Немає тегів, Будьте першим, хто поставить тег для цього запису!

Схожі ресурси

Automorphism group of certain power graphs of finite groups
за авторством: Ashrafi, Ali Reza; Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan 7317-53153, I. R. Iran, та інші
Опубліковано: (2017)

Automorphism groups of some families of bipartite graphs
за авторством: Sreekumar, K.G.; Department of Mathematics University College, Kerala, India, та інші
Опубліковано: (2021)

Bounds for graph energy in terms of vertex covering and clique numbers
за авторством: Ganie, Hilal A.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India, та інші
Опубліковано: (2019)

Chromatic number of super vertex local antimagic total labelings of graphs
за авторством: Hadiputra, Fawwaz F.; Department of Mathematics, Faculty of Mathematics and Natural Sciences Universitas Indonesia Depok - Indonesia, та інші
Опубліковано: (2021)

Vertex Coloring Edge-Weighting of Coronation by Path Graphs
за авторством: KRISTIANA, Arika Indah, та інші
Опубліковано: (2020)

On the intersection power graph of a finite group
за авторством: Bera, Sudip; Department of Mathematics, Visva-Bharati, Santin
Опубліковано: (2018)

Algoritma Penjadwalan Perkuliahan dengan Kasus Team Teaching dengan Metode Vertex Coloring Graph
за авторством: Adiwijaya, Nelly Oktavia, та інші
Опубліковано: (2016)

Inverse graphs associated with finite groups
за авторством: Alfuraidan, Monther Rashed; Department of Mathematics & Statistics King Fahd University of Petroleum and Minerals Dhahran 31261, Saudi Arabia, та інші
Опубліковано: (2017)

On the non-commuting graph of dihedral group
за авторством: Khasraw, Sanhan Muhammad Salih; Department of Mathematics, College of Education, Salahaddin University-Erbil, Erbil, Kurdistan Region, Iraq, та інші
Опубліковано: (2020)

On inclusive distance vertex irregular labelings
за авторством: Baca, Martin; Department of Applied Mathematics and Informatics, Technical University, Letna 9, Kosice, Slovakia, та інші
Опубліковано: (2018)

Domination number of the non-commuting graph of finite groups
за авторством: Vatandoost, Ebrahim; Department of Mathematics, Faculty of Science, Imam Khomeini International University, Qazvin, Iran, та інші
Опубліковано: (2018)

The rainbow k-connectivity of the non-commutative graph of a finite group
за авторством: Dupont, Luis A.; Facultad de Matem\'aticas, Universidad Veracruzana, Circuito Gonzalo Aguirre Beltr\'an S/N; Zona Universitaria; Xalapa, Ver., M\'exico, CP 91090, та інші
Опубліковано: (2020)

Total vertex irregularity strength of trees with maximum degree five
за авторством: Susilawati, S.; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia, та інші
Опубліковано: (2018)

A note on the generator subgraph of a graph
за авторством: Mame, Neil Mores; College of Arts and Sciences, Batangas State University, Batangas City, Philippines, та інші
Опубліковано: (2020)

Constructions of new integral graph families
за авторством: Gardemann, Thomas; Institute of Mathematics, University of Würzburg, та інші
Опубліковано: (2021)

Complete bipartite graph is a totally irregular total graph
за авторством: Tilukay, Meilin I.; Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Pattimura, Jalan Ir. M. Putuhena, Kampus Unpatti Poka Ambon, Indonesia, та інші
Опубліковано: (2021)

Vertex partition of hypergraphs and maximum degenerate subhypergraphs
за авторством: Schweser, Thomas; Technische Universitat Ilmenau, Inst. of Math., PF 100565, D-98684 Ilmenau, Germany. 5, D-98684 Ilmenau, Germany., та інші
Опубліковано: (2021)

Total vertex irregularity strength for trees with many vertices of degree two
за авторством: Simanjuntak, Rinovia; Combinatorial Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Jalan Ganesha 10 Bandung, Indonesia, та інші
Опубліковано: (2020)

Metric dimension of fullerene graphs
за авторством: Akhter, Shehnaz; School of Natural Sciences, National University of Sciences and Technology, H-12 Islamabad, Pakistan, та інші
Опубліковано: (2019)

A unique and novel graph matrix for efficient extraction of structural information of networks
за авторством: Karunakaran, Sivakumar; SRM Research Institute, SRM Institute of Science and Technology, Kattankulathur, Chennai, India, та інші
Опубліковано: (2021)

On classes of neighborhood resolving sets of a graph
за авторством: Sooryanarayana, B.; Department of Mathematical and Computational Studies, Dr. Ambedkar Institute of Technology, Bengaluru, Karnataka State, India, та інші
Опубліковано: (2018)

Pattern Recognition, Tracking and Vertex Reconstruction in Particle Detectors
за авторством: Frühwirth, Rudolf
Опубліковано: (2021)

Pattern Recognition, Tracking and Vertex Reconstruction in Particle Detectors
за авторством: Frühwirth, Rudolf
Опубліковано: (2021)

A note on nearly Platonic graphs with connectivity one
за авторством: Froncek, Dalibor; Department of Mathematics and Statistics, University of Minnesota Duluth, Duluth, Minnesota 55812, U.S.A, та інші
Опубліковано: (2021)

On the spectrum of a class of distance-transitive graphs
за авторством: Mirafzal, Seyed Morteza; Department of Mathematics Lorestan University, Khoramabad, Iran, та інші
Опубліковано: (2017)

Bounds for the Laplacian spectral radius of graphs
за авторством: Patra, Kamal Lochan; School of Mathematical Sciences National Institute of Science Education and Research, Bhubaneswar (HBNI), та інші
Опубліковано: (2017)

Some structural graph properties of the non-commuting graph of a class of finite Moufang loops
за авторством: Bashir, Hamideh Hasanzadeh; Department of Mathematics, Science and Research Branch, Islamic Azad University Iran, та інші
Опубліковано: (2020)

A numeral system for the middle-levels graphs
за авторством: Dejter, Italo J.; University of Puerto Rico Rio Piedras, PR 0936-8377
Опубліковано: (2021)

On strict-double-bound numbers of graphs and cut sets
за авторством: Ikeda, Kazutaka; Department of Mathematical Sciences, Tokai University, Hiratsu, та інші
Опубліковано: (2021)

Upper bounds on the bondage number of a graph
за авторством: Samodivkin, Vladimir Dimitrov; Departments of Mathematics, University of Architecture, Civil Engineering and Geodesy, Sofia, Bulgaria
Опубліковано: (2018)

On the connectivity of $k$-distance graphs
за авторством: Khormali, Omid; Department of Mathematical Sciences University of Montana, Missoula, MT 59812, USA
Опубліковано: (2017)

Textiles Market in 16th-Century Seville: Business and Mercantile Groups
за авторством: rez García
Опубліковано: (2019)

The cycle (circuit) polynomial of a graph with double and triple weights of edges and cycles
за авторством: Rosenfeld, Vladimir R.; Mathematical Chemistry Group, Department of Marine Sciences, Texas A&M University at Galveston, Galveston
Опубліковано: (2019)

Perfect codes in some products of graphs
за авторством: Bakaein, Samane; Department of Applied Mathematics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad, та інші
Опубліковано: (2021)

"Analisis Vertex r-Dynamic Coloring pada Beberapa Graf Khusus
за авторством: Arum Seruni, Devita
Опубліковано: (2016)

A method to construct graphs with certain partition dimension
за авторством: Haryeni, Debi Oktia; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Jalan Ganesa 10 Bandung, Indonesia, та інші
Опубліковано: (2019)

Total Roman domination for proper interval graphs
за авторством: Poureidi, Abolfazl; Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran
Опубліковано: (2020)

Interlace polynomials of friendship graphs
за авторством: Eubanks-Turner, Christina; Department of Mathematics, Loyola Marymount University, 90045 USA, та інші
Опубліковано: (2018)

On some aspects of the generalized Petersen graph
за авторством: Yegnanarayanan, V.; Department of Mathematics, School of Humanities and Sciences, SASTRA University, Thanjavur-613401, Tamilnadu, India
Опубліковано: (2017)

High-Efficiency Digital Readout Systems for Fast Pixel-based Vertex Detectors
за авторством: Filippo Maria Giorgi, та інші
Опубліковано: (2010)