Splice Graphs and their Vertex-Degree-Based Invariants
Splice Graphs and their Vertex-Degree-Based Invariants
Summary: Let \(G_1\) and \(G_2\) be simple connected graphs with disjoint vertex sets \(V(G_1)\) and \(V(G_2)\), respectively. For given vertices \(a_1 \in V(G_1)\) and \(a_2 \in V(G_2)\), a splice of \(G_1\) and \(G_2\) by vertices \(a_1\) and \(a_2\) is defined by identifying the vertices \(a_1\) and \(a_2\) in the union of \(G_1\) and \(G_2\). In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
- Islamic Azad University, Tehran Iran (Islamic Republic of)
splice, graph invariant, Applications of graph theory, Vertex degrees, Molecular structure (graph-theoretic methods, methods of differential topology, etc.), vertex degree
splice, graph invariant, Applications of graph theory, Vertex degrees, Molecular structure (graph-theoretic methods, methods of differential topology, etc.), vertex degree
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!