Non-Hermitian topological states in 2D line-graph lattices: Evolving triple exceptional points on reciprocal line graphs

2021 ◽  
Author(s):  
Hang Liu ◽  
Sheng Meng ◽  
Feng Liu
Keyword(s):  
Line Graph ◽  
Hexagonal Lattice ◽  
Line Graphs ◽  
Exceptional Points ◽  
Topological States ◽  
Gain And Loss ◽  
Bloch Band ◽  
Gain Loss ◽  
New Research ◽  
Sonic Crystals

Abstract Non-Hermitian (NH) topological states, such as the doubly-degenerate nodes dubbed as exceptional points (EPs) in Bloch band structure of 2D lattices driven by gain and loss, have attracted much recent interest. We demonstrate theoretically that in the three-site edge-centered lattices, i.e., the so-called line-graph lattices, such as Kagome lattice which is a line graph of hexagonal lattice, there exist three types of triply-degenerate EPs (TEPs) evolving intriguingly on another set of line graphs in the reciprocal space. A single TEP (STEP) with ±1/3 topological charge moves faithfully along the edges of reciprocal line graphs with varying gain and loss, while two STEPs merge distinctively into one unconventional orthogonal double TEP (DTEP) with ±2/3 charge at the vertices, which is characterized with two ordinary self-orthogonal eigenfunctions but one surprising “orthogonal” eigenfunction. Differently, in a modified line-graph lattice with an off-edge-center site, the ordinary coalesced state of DTEPs emerges with three identical self-orthogonal eigenfunctions. Such NH states and their evolution can be generally realized in various artificial systems, such as photonic and sonic crystals, where light and sonic vortex beams with different fractional twisting can be found. Our findings shed new light on fundamental understanding of gapless topological states in NH systems in terms of creation and evolution of high-order EPs, and open up new research directions to further link line graph and flow network theory coupled with topological physics, especially under non-equilibrium gain/loss conditions.

scholarly journals Topological invariants for the line graphs of some classes of graphs

2019 ◽  
Vol 17 (1) ◽  
pp. 1483-1490
Author(s):  
Xiaoqing Zhou ◽  
Mustafa Habib ◽  
Tariq Javeed Zia ◽  
Asim Naseem ◽  
Anila Hanif ◽  
...  
Keyword(s):  
Communication Theory ◽  
Chemical Reactivity ◽  
Line Graph ◽  
Chemical Properties ◽  
Topological Invariants ◽  
Line Graphs ◽  
Physical And Chemical Properties ◽  
Physical And Chemical ◽  
Ladder Graphs ◽  
And Chemical Properties

AbstractGraph theory plays important roles in the fields of electronic and electrical engineering. For example, it is critical in signal processing, networking, communication theory, and many other important topics. A topological index (TI) is a real number attached to graph networks and correlates the chemical networks with physical and chemical properties, as well as with chemical reactivity. In this paper, our aim is to compute degree-dependent TIs for the line graph of the Wheel and Ladder graphs. To perform these computations, we first computed M-polynomials and then from the M-polynomials we recovered nine degree-dependent TIs for the line graph of the Wheel and Ladder graphs.

scholarly journals A Strengthening of Brooks' Theorem for Line Graphs

10.37236/632 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Landon Rabern
Keyword(s):  
Chromatic Number ◽  
Maximum Degree ◽  
Line Graph ◽  
Clique Number ◽  
Line Graphs ◽  
Delta G

We prove that if $G$ is the line graph of a multigraph, then the chromatic number $\chi(G)$ of $G$ is at most $\max\left\{\omega(G), \frac{7\Delta(G) + 10}{8}\right\}$ where $\omega(G)$ and $\Delta(G)$ are the clique number and the maximum degree of $G$, respectively. Thus Brooks' Theorem holds for line graphs of multigraphs in much stronger form. Using similar methods we then prove that if $G$ is the line graph of a multigraph with $\chi(G) \geq \Delta(G) \geq 9$, then $G$ contains a clique on $\Delta(G)$ vertices. Thus the Borodin-Kostochka Conjecture holds for line graphs of multigraphs.

Square-root-like higher-order topological states in three-dimensional sonic crystals

2021 ◽  
Author(s):  
Zhiguo Geng ◽  
Huanzhao Lv ◽  
Zhan Xiong ◽  
Yu-Gui Peng ◽  
Zhaojiang Chen ◽  
...  
Keyword(s):  
Three Dimensional ◽  
Surface States ◽  
Higher Order ◽  
Square Root ◽  
Root Lattice ◽  
Third Order ◽  
Topological Materials ◽  
Topological States ◽  
Sonic Crystal ◽  
Sonic Crystals

Abstract The square-root descendants of higher-order topological insulators were proposed recently, whose topological property is inherited from the squared Hamiltonian. Here we present a three-dimensional (3D) square-root-like sonic crystal by stacking the 2D square-root lattice in the normal (z) direction. With the nontrivial intralayer couplings, the opened degeneracy at the K-H direction induces the emergence of multiple acoustic localized modes, i.e., the extended 2D surface states and 1D hinge states, which originate from the square-root nature of the system. The square-root-like higher order topological states can be tunable and designed by optionally removing the cavities at the boundaries. We further propose a third-order topological corner state in the 3D sonic crystal by introducing the staggered interlayer couplings on each square-root layer, which leads to a nontrivial bulk polarization in the z direction. Our work sheds light on the high-dimensional square-root topological materials, and have the potentials in designing advanced functional devices with sound trapping and acoustic sensing.

On Spanning and Dominating Circuits in Graphs

1977 ◽  
Vol 20 (2) ◽  
pp. 215-220 ◽  
Author(s):  
L. Lesniak-Foster ◽  
James E. Williamson
Keyword(s):  
Line Graph ◽  
Dominating Set ◽  
Line Graphs ◽  
Sufficient Condition ◽  
Vertex Set ◽  
On Line ◽  
One To One

AbstractA set E of edges of a graph G is said to be a dominating set of edges if every edge of G either belongs to E or is adjacent to an edge of E. If the subgraph 〈E〉 induced by E is a trail T, then T is called a dominating trail of G. Dominating circuits are defined analogously. A sufficient condition is given for a graph to possess a spanning (and thus dominating) circuit and a sufficient condition is given for a graph to possess a spanning (and thus dominating) trail between each pair of distinct vertices. The line graph L(G) of a graph G is defined to be that graph whose vertex set can be put in one-to-one correspondence with the edge set of G in such a way that two vertices of L(G) are adjacent if and only if the corresponding edges of G are adjacent. The existence of dominating trails and circuits is employed to present results on line graphs and second iterated line graphs, respectively.

scholarly journals Efficient Algorithm for Generating Maximal L-Reflexive Trees

Symmetry ◽  
2020 ◽  
Vol 12 (5) ◽  
pp. 809
Author(s):  
Milica Anđelić ◽  
Dejan Živković
Keyword(s):  
Efficient Algorithm ◽  
Line Graph ◽  
Common Vertex ◽  
Line Graphs ◽  
Algebraic Numbers ◽  
Pisot Numbers ◽  
Full Characterization ◽  
Vertex Set ◽  
Second Largest Eigenvalue

The line graph of a graph G is another graph of which the vertex set corresponds to the edge set of G, and two vertices of the line graph of G are adjacent if the corresponding edges in G share a common vertex. A graph is reflexive if the second-largest eigenvalue of its adjacency matrix is no greater than 2. Reflexive graphs give combinatorial ground to generate two classes of algebraic numbers, Salem and Pisot numbers. The difficult question of identifying those graphs whose line graphs are reflexive (called L-reflexive graphs) is naturally attacked by first answering this question for trees. Even then, however, an elegant full characterization of reflexive line graphs of trees has proved to be quite formidable. In this paper, we present an efficient algorithm for the exhaustive generation of maximal L-reflexive trees.

Motion Comparison Method Combining Segmented Multi-Joint Line Graphs with the SIFT Matching Technique

2014 ◽  
Vol 599-601 ◽  
pp. 1566-1570
Author(s):  
Ming Zeng ◽  
Hong Lin Ren ◽  
Qing Hao Meng ◽  
Chang Wei Chen ◽  
Shu Gen Ma
Keyword(s):  
Feature Matching ◽  
Line Graph ◽  
Comparison Method ◽  
Joint Line ◽  
Line Graphs ◽  
3D Motion ◽  
Motion Data ◽  
Comparison Results ◽  
Matching Technique ◽  
Sift Features

In this paper, an effective motion comparison method based on segmented multi-joint line graphs combined with the SIFT feature matching method is proposed. Firstly, the multi-joint 3D motion data are captured using the Kinect. Secondly, 3D motion data are normalized and distortion data are removed. Therefore, a 2D line graph can be obtained. Next, SIFT features of the 2D motion line graph are extracted. Finally, the line graphs are divided into several regions and then the comparison results can be calculated based on SIFT matching ratios between the tutor’s local line graph and the trainee’s local line graph. The experimental results show that the proposed method not only can easily deal with the several challenge problems in motion analysis, e.g., the problem of different rhythm of motions, the problem of a large amount of data, but also can provide detailed error correction cues.

Demineralization and Remineralization Evaluation Techniques—Added Considerations

1992 ◽  
Vol 71 (3_suppl) ◽  
pp. 929-933 ◽  
Author(s):  
D.J. White ◽  
R.V. Faller ◽  
W.D. Bowman
Keyword(s):  
Accurate Determination ◽  
Polarized Light ◽  
Specimen Handling ◽  
Study Protocols ◽  
Indirect Measures ◽  
Gain And Loss ◽  
Gain Loss ◽  
Direct Measures ◽  
Evaluation Techniques

Methods used for the analysis of tooth de- and remineralization include techniques with various degrees of sophistication and quantitative capabilities, ranging from direct measures of mineral gain/loss (e.g., microradiography) to indirect measures (e.g., iodide permeability) of changes in tooth mineral properties. In all instances, the capabilities of methods for accurate determination of changes in tooth mineral properties are affected by procedures used in the preparation of specimens for analysis, the magnitude of change taking place in the test (vs. the detection limits of the techniques), and protocols for specimen analysis. In specific instances, such as in the case of dentin, unique specimen-handling and analysis procedures must be used to prevent artifacts. The choice of techniques for the assessment of de- and remineralization depends strongly upon study protocols and laboratory capabilities; however, ‘quantitative’ measures of mineral gain and loss are possible only if direct chemical or radiographic techniques are used. Either radiographic, cross-sectioned microhardness or polarized light can be used for the determination of lesion depth. Porosity, light-scattering, and surface microhardness are indirect techniques which complement direct measures of mineral gain and loss. Whatever methods are used in the analysis of de- and remineralization, researchers must take care to differentiate accurately among the quantitative capabilities of techniques used in analysis.

scholarly journals PRIMARY SCHOOL STUDENTS’ READING LEVELS OF LINE GRAPHS

2021 ◽  
Vol 20 (2) ◽  
pp. 6
Author(s):  
PEDRO ARTEAGA ◽  
DANILO DÍAZ-LEVICOY ◽  
CARMEN BATANERO
Keyword(s):  
Primary School ◽  
Line Graph ◽  
Reading Level ◽  
Primary School Children ◽  
Line Graphs ◽  
School Students ◽  
Reading Levels ◽  
Grade Levels ◽  
Data Value ◽  
Educación Primaria

The aim of this research was to describe the errors and reading levels that 6th and 7th grade Chilean primary school children reach when working with line graphs. To achieve this objective, we gave a questionnaire, previously validated by experts with two open-ended tasks, to a sample of 745 students from different Chilean cities. In the first task, we asked the children to read the title of the graph, describe the variables represented and perform a direct and inverse reading of a data value. In the second task, where we address the visual effect of a scale change in a representation, the students had to select the line graph more convenient to a candidate. Although both tasks were considered easy for the grade levels targeted, only some of the students achieved the highest reading level and many made occasional errors in the reading of the graphs. Abstract: Spanish El objetivo de esta investigación es describir los errores y niveles de lectura que alcanzan estudiantes chilenos de 6º y 7º grado de Educación Primaria al trabajar con gráficos de líneas. Para lograr este objetivo, se aplicó un cuestionario, previamente validado por expertos, con dos tareas abiertas a una muestra de 745 estudiantes de diferentes ciudades chilenas. En la primera tarea, se pidió que leyeran el título del gráfico, indicaran las variables representadas y realizaran una lectura directa y otra inversa de un valor de datos. En la segunda tarea, los estudiantes deben seleccionar y justificar el gráfico de líneas más conveniente para respaldar a un candidato, donde se aborda el efecto visual de cambio de escala en una representación. Aunque ambas tareas fueron fáciles, solo una parte de los estudiantes logró el máximo nivel de lectura y aparecieron errores ocasionales en la lectura de los gráficos.

scholarly journals Line Graphs of Monogenic Semigroup Graphs

2021 ◽  
Vol 2021 ◽  
pp. 1-4
Author(s):  
Nihat Akgunes ◽  
Yasar Nacaroglu ◽  
Sedat Pak
Keyword(s):  
Maximum Degree ◽  
Zero Divisor ◽  
Minimum Degree ◽  
Line Graph ◽  
Domination Number ◽  
Clique Number ◽  
Line Graphs ◽  
Monogenic Semigroup ◽  
Graph Properties ◽  
Graph Parameters

The concept of monogenic semigroup graphs Γ S M is firstly introduced by Das et al. (2013) based on zero divisor graphs. In this study, we mainly discuss the some graph properties over the line graph L Γ S M of Γ S M . In detail, we prove the existence of graph parameters, namely, radius, diameter, girth, maximum degree, minimum degree, chromatic number, clique number, and domination number over L Γ S M .

Sign in / Sign up

Export Citation Format

Share Document