Results 41 to 50 of about 207,710 (268)

Connectivity Index in Vague Graphs with Application in Construction

Discrete Dynamics in Nature and Society, 2022
The vague graph (VG), which has recently gained a place in the family of fuzzy graph (FG), has shown good capabilities in the face of problems that cannot be expressed by fuzzy graphs and interval-valued fuzzy graphs. Connectivity index (CI) in graphs is
Huiqin Jiang, Yongsheng Rao
doaj   +1 more source

On vertex and edge degree-based topological indices

Vojnotehnički Glasnik, 2023
Introduction/purpose: The entire topological indices (T Ient) are a class of graph invariants depending on the degrees of vertices and edges. Some general properties of these invariants are established.
Ivan Gutman
doaj   +1 more source

Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths [PDF]

, 2018
When can a plane graph with prescribed edge lengths and prescribed angles (from among $\{0,180^\circ, 360^\circ$\}) be folded flat to lie in an infinitesimally thin line, without crossings?
Abel, Zachary, Demaine, Erik D., Demaine, Martin L., Eppstein, David, Lubiw, Anna, Uehara, Ryuhei   +5 more
core   +2 more sources

Spin Foams Without Spins [PDF]

, 2016
We formulate the spin foam representation of discrete SU(2) gauge theory as a product of vertex amplitudes each of which is the spin network generating function of the boundary graph dual to the vertex.
Hnybida, Jeff
core   +2 more sources

Fast branching algorithm for Cluster Vertex Deletion [PDF]

, 2013
In the family of clustering problems, we are given a set of objects (vertices of the graph), together with some observed pairwise similarities (edges).
A. Ben-Dor, B.A. Reed, C. Komusiewicz, F. Hüffner, F. Hüffner, F. Protti, F.N. Abu-Khzam, F.N. Abu-Khzam, F.V. Fomin, F.V. Fomin, H. Fernau, H.L. Bodlaender, I. Giotis, J. Gramm, J. Gramm, J. Guo, J. Guo, L. Cai, M.R. Fellows, N. Bansal, P. Damaschke, R. Shamir, S. Böcker, S. Böcker, S. Böcker, S. Böcker   +25 more
core   +2 more sources

On the Distribution of Vertex Energy of Connected Non-Regular Non-Bipartite Integral Graphs with Maximum Vertex Degree Four

Scientific Annals of Computer Science
The energy of a vertex in a graph plays a very important role in terms of its contribution to the total energy of a graph, a significant graph invariant in the field of chemical graph theory.
P. N. Simha, B. P. Shylaja, N. Narahari, H. M. Nagesh, U. V. C. Kumar   +4 more
doaj   +1 more source

Inverse monoids of partial graph automorphisms

, 2020
A partial automorphism of a finite graph is an isomorphism between its vertex induced subgraphs. The set of all partial automorphisms of a given finite graph forms an inverse monoid under composition (of partial maps). We describe the algebraic structure
Jajcay, Robert, Jajcayova, Tatiana, Szakács, Nóra, Szendrei, Mária B.   +3 more
core   +1 more source

Analysis of Rainbow Vertex Antimagic Coloring and its Application to Cryptographic Secret Sharing with Affine Cipher Technique

JTAM (Jurnal Teori dan Aplikasi Matematika)
Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik, Iftitahul Firdausiyah, Robiatul Adawiyah, Ika Hesti Agustin, Indah Lutfiyatul Mursyidah, Marsidi Marsidi   +5 more
doaj   +1 more source

Game Chromatic Number of Tadpole Graph, Broom Graph, and Tribune Graph

JTAM (Jurnal Teori dan Aplikasi Matematika)
Graph coloring game is one of application in graph theory. The goal in this article is determine game chromatic number of tadpole graph, broom graph, and tribune graph.
Fransiskus Fran, M Luthfi Abdurahman
doaj   +1 more source

Unfolding of Finite Concurrent Automata [PDF]

Electronic Proceedings in Theoretical Computer Science, 2018
We consider recognizable trace rewriting systems with level-regular contexts (RTL). A trace language is level-regular if the set of Foata normal forms of its elements is regular. We prove that the rewriting graph of a RTL is word-automatic.
Alexandre Mansard
doaj   +1 more source