Results 31 to 40 of about 9,193,291 (353)
Degree Sequence of Graph Operator for some Standard Graphs
, 2020 Topological indices play a very important role in the mathematical chemistry. The topological indices are numerical parameters of a graph. The degree sequence is obtained by considering the set of vertex degree of a graph.
Harisha +3 more
semanticscholar +1 more source
Scaling limits of random bipartite planar maps with a prescribed degree sequence [PDF]
Random Struct. Algorithms, 2016 We study the asymptotic behavior of uniform random maps with a prescribed face‐degree sequence, in the bipartite case, as the number of faces tends to infinity.
Cyril Marzouk
semanticscholar +1 more source
Spectral ordering and 2-switch transformations [PDF]
The American Journal of Combinatorics, 2022 We address the problem of ordering trees with the same degree sequence by their spectral radii. To achieve that, we consider 2-switch transformations which preserve the degree sequence and establish when the index decreases.
Elismar Oliveira +2 more
doaj +3 more sources
On the Grone-Merris conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Grone and Merris [GM94] conjectured that the Laplacian spectrum of a graph is majorized by its conjugate vertex degree sequence. We prove that this conjecture holds for a class of graphs including trees.
Tamon Stephen
doaj +1 more source
Some new results on sum index and difference index
AIMS Mathematics, 2023 Let $ G = (V(G), E(G)) $ be a graph with a vertex set $ V(G) $ and an edge set $ E(G) $. For every injective vertex labeling $ f:V\left (G \right)\to \mathbb{Z} $, there are two induced edge labelings denoted by $ f^{+} :E\left (G \right)\to \mathbb{Z} $
Yuan Zhang, Haiying Wang
doaj +1 more source
Symmetric bipartite graphs and graphs with loops [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Grant Cairns, Stacey Mendan
doaj +1 more source
Directed Networks with a Differentially Private Bi-degree Sequence [PDF]
Statistica sinica, 2017 Although a lot of approaches are developed to release network data with a differentially privacy guarantee, inference using noisy data in many network models is still unknown or not properly explored.
T. Yan
semanticscholar +1 more source
Ubiquity, 2008 I ndi got her BS in Computer Science from Cal Poly and began her master's at Colorado State. She then worked as a software engineer, later managing Web applications that focused on the user. Her concepts in mental models derive from attempting to bridge the developer-user gap.
Samar Sen Sarma +3 more
openaire +2 more sources
The irregularity of two types of trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The irregularity of a graph $G$ is defined as the sum of weights $|d(u)-d(v)|$ of all edges $uv$ of $G$, where $d(u)$ and $d(v)$ are the degrees of the vertices $u$ and $v$ in $G$, respectively.
Li Jianxi, Yang Liu, Wai Shiu
doaj +1 more source
An inequality for degree sequences
Discrete Mathematics, 1992 AbstractLet d1, d2, …,dn be the degree sequence of a simple graph and suppose p is a positive integer. We show that (∑ni=1d1/pi)p ⩾ ∑ni=1 dpi. Related ‘real’ inequalities, i.e., not graphdependent, are analyzed.
L. H. Clark +2 more
openaire +2 more sources