Tadpole graphs

Tadpole graphs

A tadpole graph is a type of graph that is formed by connecting a cycle graph to a path with a bridge. It is also known as a dragon graph or kite graph. The free Schrödinger group on the tadpole graph satisfies the standard dispersive estimate and is independent of the length of the circle, according to a study by Ali Mehmeti, Ammari, and Nicaise in 2017.From: Mathematical Modeling and Soft Computing in Epidemiology [2020], Controllability of localised quantum states on infinite graphs through bilinear control fields [2021]

Mathematical Modeling to Find the Potential Number of Ways to Distribute Certain Things to Certain Places in Medical Field

View Chapter

Purchase Book

Published in Jyoti Mishra, Ritu Agarwal, Abdon Atangana, Mathematical Modeling and Soft Computing in Epidemiology, 2020

G. Mahadevan, S. Anuthiya, M. Vimala Suganthi

The (m, n) tadpole graph, also called a dragon graph or kite graph, is the graph obtained by joining a cycle graph to a path with a bridge. The (m, n) lollipop graph is obtained by joining a complete graph to a path graph with a bridge. For n ≥ 3, a closed helm graph CHn is obtained from Hn by adding edges between the pendent vertices where supports in base wheel are adjacent. A uniform n-ply graph is a graph obtained from n distinct paths Pm, m ≥ 3 by merging all the initial vertices to a vertex u and all the terminal vertices to a vertex v. The uniform n-ply graph is denoted by Pn(u, v). Tn(K1,m) is obtained by pasting the root vertex of K(1, m) to the nth vertex of the path in the triangular snake graph T.

Controllability of localised quantum states on infinite graphs through bilinear control fields

View Article

Journal Information

Published in International Journal of Control, 2021

Kaïs Ammari, Alessandro Duca

Let be an infinite tadpole graph composed by two edges and . The self-closing edge , the ‘head’, is connected to in the vertex v and it is parametrised in the clockwise direction with a coordinate going from 0 to 1 (the length of ). The ‘tail’ is a half-line equipped with a coordinate starting from 0 in v and going to .

Explore chapters and articles related to this topic

Mathematical Modeling to Find the Potential Number of Ways to Distribute Certain Things to Certain Places in Medical Field

Controllability of localised quantum states on infinite graphs through bilinear control fields