Results 31 to 40 of about 5,978,611 (274)
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
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
One-Mother Vertex Graphs [PDF]
, 2011 In this paper we will define a new type of graph. The idea of this definition is based on when we illustrate the cardiovascular system by a graph we find that not all vertices have the same important so we define this new graph and call it 1- mother ...
Salama, F.
core +1 more source
From Time–Frequency to Vertex–Frequency and Back
Mathematics, 2021 The paper presents an analysis and overview of vertex–frequency analysis, an emerging area in graph signal processing. A strong formal link of this area to classical time–frequency analysis is provided.
Ljubiša Stanković +5 more
doaj +1 more source
On the conjunctive capacity of graphs [PDF]
, 2013 The investigation of the asymptotic behaviour of various graph parameters in powers of a fixed graph G=(V,E) is motivated by problems in information theory and extremal ...
Chlebikova, Janka +5 more
core +1 more source
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 +5 more
doaj +1 more source
3-degenerate induced subgraph of a planar graph [PDF]
, 2021 A graph $G$ is $d$-degenerate if every non-null subgraph of $G$ has a vertex of degree at most $d$. We prove that every $n$-vertex planar graph has a $3$-degenerate induced subgraph of order at least $3n/4$.Comment: 28 pages, 12 ...
Oum, Sang-il +12 more
core +1 more source
An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem in Graph Theory
, 2018 The connected vertex cover (CVC) problem is a variant of the vertex cover problem, which has many important applications, such as wireless network design, routing and wavelength assignment problem, etc. A good algorithm for the problem can help us improve engineering efficiency, cost savings and resources in industrial applications.
Yongfei Zhang +5 more
openaire +2 more sources
Dilation theory for rank two graph algebras. [PDF]
, 2010 An analysis is given of $*$-representations of rank 2 single vertex graphs. We develop dilation theory for the non-selfadjoint algebras $\A_\theta$ and $\A_u$ which are associated with the commutation relation permutation $\theta$ of a 2-graph and, more ...
Yang, Dilian +2 more
core +4 more sources
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