相关论文: A Method for Computing the Edge-Hyper-Wiener Index…

The Wiener index W(G) of a graph G is the sum of distances between all unordered pairs of its vertices. Dobrynin and Mel'nikov [in: Distance in Molecular Graphs - Theory, 2012, p. 85-121] propose the study of estimates for extremal values…

Let $G(V,E)$ be a graph, and $\mathscr{H}:=\big\{H:H\subseteq G\big\}$ denote the collection of all possible subgraphs of $G$. Then for each non-negative function $w:\mathscr{H}\to\mathbb{R_+}$, the graph $G(V,E,w)$ is said to be a weighted…

A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight.…

A hypergraph is a data structure composed of nodes and hyperedges, where each hyperedge is an any-sized subset of nodes. Due to the flexibility in hyperedge size, hypergraphs represent group interactions (e.g., co-authorship by more than…

Many networks, such as transportation, power, and water distribution, can be represented as graphs. Crucial challenge in graph representations is identifying the importance of graph edges and their influence on overall network efficiency…

In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…

In this work, we estimate the number of hyperedges in a hypergraph ${\cal H}(U({\cal H}), {\cal F}({\cal H}))$, where $U({\cal H})$ denotes the set of vertices and ${\cal F}({\cal H}))$ denotes the set of hyperedges. We assume a query…

In this note, we discuss the method explained in the recent paper [P. Manuel, I. Rajasingh, B. Rajan, R. Sundara Rajan, A New Approach To Compute Wiener Index, Journal of Computational and Theoretical Nanoscience 10, (2013) 1515-1521.] for…

The first and the second Zagreb eccentricity index of a graph $G$ are defined as $E_1(G)=\sum_{v\in V(G)}\varepsilon_{G}(v)^{2}$ and $E_2(G)=\sum_{uv\in E(G)}\varepsilon_{G}(u)\varepsilon_{G}(v)$, respectively, where $\varepsilon_G(v)$ is…

The inducibility of a graph $H$ measures the maximum number of induced copies of $H$ a large graph $G$ can have. Generalizing this notion, we study how many induced subgraphs of fixed order $k$ and size $\ell$ a large graph $G$ on $n$…

Recently, techniques for applying convolutional neural networks to graph-structured data have emerged. Graph convolutional neural networks (GCNNs) have been used to address node and graph classification and matrix completion. Although the…

Cut vertices are often used as a measure of nodes' importance within a network. They are those nodes whose failure disconnects a graph. Let N(G) be the number of connected induced subgraphs of a graph $G$. In this work, we investigate the…

The hyper Zagreb index is a kind of extensions of Zagreb index, used for predicting physicochemical properties of organic compounds. Given a graph $G= (V(G), E(G))$, the first hyper-Zagreb index is the sum of the square of edge degree over…

Hansen et. al. used the computer programm AutoGraphiX to study the differences between the Szeged index $Sz(G)$ and the Wiener index $W(G)$, and between the revised Szeged index $Sz^*(G)$ and the Wiener index for a connected graph $G$. They…

Let $G$ be a finite group. The intersection graph of $G$ is a graph whose vertex set is the set of all proper non-trivial subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $H\cap K \neq \{e\}$, where $e$ is…

This work introduces a novel algorithm for finding the connected components of a graph where the vertices and edges are grouped into sets defining a Set--Based Graph. The algorithm, under certain restrictions on those sets, has the…

For an undirected, simple, finite, connected graph $G$, we denote by $V(G)$ and $E(G)$ the sets of its vertices and edges, respectively. A function $\varphi:E(G)\rightarrow \{1,...,t\}$ is called a proper edge $t$-coloring of a graph $G$,…

Let $G=(V,E,w)$ be a finite, connected graph with weighted edges. We are interested in the problem of finding a subset $W \subset V$ of vertices and weights $a_w$ such that $$ \frac{1}{|V|}\sum_{v \in V}^{}{f(v)} \sim \sum_{w \in W}{a_w…

An edge-ordering of a graph $G=(V,E)$ is a bijection $\phi:E\to\{1,2,...,|E|\}$. Given an edge-ordering, a sequence of edges $P=e_1,e_2,...,e_k$ is an increasing path if it is a path in $G$ which satisfies $\phi(e_i)<\phi(e_j)$ for all…

Let $S$ be a set of vertices of a connected graph $G$. The Steiner distance of $S$ is the minimum size of a connected subgraph of $G$ containing all the vertices of $S$. The sum of all Steiner distances on sets of size $k$ is called the…