Results 31 to 40 of about 1,373,880 (187)

Topological Graph Polynomials in Colored Group Field Theory [PDF]

, 2009
In this paper we analyze the open Feynman graphs of the Colored Group Field Theory introduced in [arXiv:0907.2582]. We define the boundary graph $\cG_{\partial}$ of an open graph $\cG$ and prove it is a cellular complex.
A. Connes, B. Bollobás, B. Bollobás, B. Bollobás, C. Itzykson, D. Boulatov, E.R. Livine, F. Conrady, F. David, G. Kirchhoff, G. ‘t Hooft, G. ’t Hooft, H. Grosse, H. Grosse, H. Grosse, H.H. Crapo, J. Engle, J. Engle, J.B. Geloun, L. Freidel, L. Freidel, L. Freidel, M. Disertori, M. Disertori, M. Gross, M.R. Douglas, N. Nakanishi, N. Sasakura, R. De Pietri, R. Gurau, R. Gurau, R. Gurau, R. Gurau, Razvan Gurau, V. Bonzom, V. Rivasseau, V. Rivasseau, W.T. Tutte   +37 more
core   +1 more source

RAINBOW VERTEX CONNECTION NUMBER OF BULL GRAPH, NET GRAPH, TRIANGULAR LADDER GRAPH, AND COMPOSITION GRAPH (P_n [P_1 ])

Barekeng
The rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi, Robiatul Adawiyah, Dafik Dafik, I Nengah Suparta   +3 more
doaj   +1 more source

Interval Valued Pentapartitioned Neutrosophic Graphs with an Application to MCDM

Operational Research in Engineering Sciences: Theory and Applications, 2022
The concept of interval valued pentapartitioned neutrosophic set is the extension of interval-valued neutrosophic set, quadripartitioned neutrosophic set, interval valued quadripartitioned neutrosophic set and pentapartitioned neutrosophic set.
Said Broumi, D Ajay, P Chellamani, Lathamaheswari Malayalan, Mohamed Talea, Assia Bakali, Philippe Schweizer, Saeid Jafari   +7 more
doaj   +1 more source

Relating graph energy with vertex-degree-based energies [PDF]

Vojnotehnički Glasnik, 2020
Introduction/purpose: The paper presents numerous vertex-degree-based graph invariants considered in the literature. A matrix can be associated to each of these invariants.
Ivan Gutman
doaj   +1 more source

Twistor theory on a finite graph

, 2010
We show how the description of a shear-free ray congruence in Minkowski space as an evolving family of semi-conformal mappings can naturally be formulated on a finite graph. For this, we introduce the notion of holomorphic function on a graph.
A.C.M. van Rooij, C. Rovelli, H. Urakawa, H. Whitney, I. Vaisman, M. Baker, M.G. Eastwood, Mohammad Wehbe, P. Baird, P. Baird, Paul Baird, R. Penrose, R. Penrose, S. Gnutzman, S. Huggett   +14 more
core   +1 more source

Embedded graph invariants in Chern-Simons theory [PDF]

, 1998
Chern-Simons gauge theory, since its inception as a topological quantum field theory, has proved to be a rich source of understanding for knot invariants.
Alvarez, Alvarez, Alvarez, Ashtekar, Ashtekar, Ashtekar, Ashtekar, Ashtekar, Ashtekar, Ashtekar, Ashtekar, Ashtekar, Ashtekar, Atiyah, Baez, Baez, Baez, Barrett, Birman, Birman, Borissov, Brügmann, De Pietri, De Pietri, Fittelli, Gambini, Gambini, Gambini, Gambini, Guadagnini, Jones, Kauffman, Kodama, Labastida, Lewandowski, Lickorish, Loll, Major, Marolf, Marolf, Martin, Moussouris, Penrose, Rovelli, Rovelli, Rovelli, Rovelli, Rovelli, Seth A. Major, Smolin, van de Wetering, White, Witten, Witten, Witten   +54 more
core   +3 more sources

Distance antimagic labeling of circulant graphs

AIMS Mathematics
A distance antimagic labeling of graph $ G = (V, E) $ of order $ n $ is a bijection $ f:V(G)\rightarrow \{1, 2, \ldots, n\} $ with the property that any two distinct vertices $ x $ and $ y $ satisfy $ \omega(x)\ne\omega(y) $, where $ \omega(x) $ denotes ...
Syafrizal Sy , Rinovia Simanjuntak, Tamaro Nadeak, Kiki Ariyanti Sugeng , Tulus Tulus   +4 more
doaj   +1 more source

A Comprehensive Discussion on Fuzzy Hypersoft Expert, Superhypersoft, and IndetermSoft Graphs [PDF]

Neutrosophic Sets and Systems
Graph theory, a branch of mathematics, studies relationships among entities through vertices and edges. To capture the inherent uncertainties in real-world networks, Uncertain Graph Theory has evolved within this field.
Takaaki Fujita
doaj   +1 more source

Graph Laplacians and Stabilization of Vehicle Formations [PDF]

, 2001
Control of vehicle formations has emerged as a topic of significant interest to the controls community. In this paper, we merge tools from graph theory and control theory to derive stability criteria for formation stabilization.
Fax, J. Alexander, Murray, Richard M.
core   +1 more source

Comparative Study of Planar Octahedron Molecular Structure via Eccentric Invariants

Molecules, 2023
A branch of graph theory that makes use of a molecular graph is called chemical graph theory. Chemical graph theory is used to depict a chemical molecule. A graph is connected if there is an edge between every pair of vertices.
Zheng-Qing Chu, Haidar Ali, Didar Abdulkhaleq Ali, Muhammad Nadeem, Syed Ajaz K. Kirmani, Parvez Ali   +5 more
doaj   +1 more source