Results 51 to 60 of about 91 (80)
Steiner Degree Distance of Two Graph Products
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 The degree distance DD(G) of a connected graph G was invented by Dobrynin and Kochetova in 1994. Recently, one of the present authors introduced the concept of k-center Steiner degree distance defined as SDDk(G)=∑S⊆V(G)|S|=k[∑v∈SdegG(v)]dG(S),SDD_k (G)
Mao Yaping, Wang Zhao, Das Kinkar Ch.
doaj +1 more source
On the maximum atom-bond sum-connectivity index of graphs
Open MathematicsThe atom-bond sum-connectivity (ABS) index of a graph GG with edges e1,…,em{e}_{1},\ldots ,{e}_{m} is the sum of the numbers 1−2(dei+2)−1\sqrt{1-2{\left({d}_{{e}_{i}}+2)}^{-1}} over 1≤i≤m1\le i\le m, where dei{d}_{{e}_{i}} is the number of edges adjacent
Alraqad Tariq +3 more
doaj +1 more source
Structure of Graph Posets for Orders 4 to 8
, 2004 The poset G(n) comprises the unlabelled simple graphs of order n, with partial ordering G H whenever G is a spanning subgraph of H. We dene a modifieded Steinbach numbering of the graphs in G(n), apply this numbering to each G(n) with n 8, and use it to ...
Eggleton, Roger B. +5 more
core
On the first Zagreb index and multiplicative Zagreb coindices of graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 For a (molecular) graph G with vertex set V (G) and edge set E(G), the first Zagreb index of G is defined as , where dG(vi) is the degree of vertex vi in G. Recently Xu et al. introduced two graphical invariants and named as first multiplicative Zagreb
Das Kinkar Ch. +5 more
doaj +1 more source
Mathematical and Computer Modelling of Dynamical SystemsVertex and edge operations are very popular tools in studying several properties of graphs, as they help us to calculate complex statements by means of easier or well-known ones. Deletion is probably the most important graph operation.
Hacer Ozden Ayna, Ismail Naci Cangul
doaj +1 more source
Novel procedures for graph edge-colouring
, 2018 Orientador: Dr. Renato CarmoCoorientador: Dr. André Luiz Pires GuedesTese (doutorado) - Universidade Federal do Paraná, Setor de Ciências Exatas, Programa de Pós-Graduação em Informática.
Zatesko, Leandro Miranda, 1988-
core
A novel algebraic technique for adjacency matrices of some derived graphs
Mathematical and Computer Modelling of Dynamical SystemsGraph energy has been the main concern of spectral graph theory in the last five decades. The classical graph energy is the sum of the absolute values of the eigenvalues of the adjacency matrix. In many research papers, different versions of graph energy
Hacer Ozden Ayna +5 more
doaj +1 more source
On the maximum atom-bond sum-connectivity index of molecular trees
AKCE International Journal of Graphs and CombinatoricsLet G be a graph with V(G) and E(G), as vertex set and edge set, respectively. The atom-bond sum-connectivity (ABS) index is a vertex-based topological index which is defined as [Formula: see text] where [Formula: see text] is the degree of the vertex a.
Zhonglin Cheng +2 more
doaj +1 more source
On the vv-degree based first Zagreb index of graphs
AKCE International Journal of Graphs and CombinatoricsA topological index is a graph invariant applicable in chemistry. The first Zagreb index is a topological index based on the vertex degrees of molecular graphs. For any graph G, the first Zagreb index [Formula: see text] is equal to the sum of squares of
L. Anusha +2 more
doaj +1 more source
Network-based kinetic models: Emergence of a statistical description of the graph topology
European Journal of Applied MathematicsIn this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems.
Marco Nurisso +2 more
doaj +1 more source