Method of characteristic functions for classes of networks with fixed node degrees

DOI10.1134/S1064230714050128zbMATH Open1339.90326OpenAlexW2083429305MaRDI QIDQ2017647FDOQ2017647

P. S. Selin, V. I. Tsurkov

Publication date: 23 March 2015

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230714050128

Recommendations

• scientific article; zbMATH DE number 4020411
• Characteristic polynomial of adjacency or Laplacian matrix for weighted treelike networks
• The method of moments and degree distributions for network models
• scientific article; zbMATH DE number 3939115
• A robust method for fitting degree distributions of complex networks
• A characterization of solvability for a class of networks
• A characteristic equation associated to an eigenvalue problem on \(c^ 2\)-networks
• Characterizations of network structures using eigenmode analysis
• scientific article

zbMATH Keywords

characteristic functionsflows in networkssum of arc weights

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• Approximation and decomposition by extremal graphs
• Title not available (Why is that?)
• Minimax under transportation constraints
• Transportation problems with a minimax criterion
• Network models with fixed parameters at the communication nodes. II
• Network models with fixed parameters at the communication nodes. I
• Method of partition of networks with fixed degrees of nodes and network flows
• Weighted graphs with fixed vertex degrees and network flows
• Transport-type problems with a minimax criterion
• A minimax under nonlinear transportation constraints.
• Open transportation models with a minimax criterion.
• Closed transportation models with minimax criterion
• Minimax in transportation models with integral constraints. II
• Title not available (Why is that?)
• Minimax in transportation models with integral constraints. I
• Transport and network problems with the minimax criterion
• A triplanar transportation problem with a minimax criterion

Cited In (4)

• Characterizations of the \(\beta\)- and the degree network power measure
• Second-order and local characteristics of network intensity functions
• Network models with fixed parameters at the communication nodes. I
• Functional characteristics of a node determinant

This page was built for publication: Method of characteristic functions for classes of networks with fixed node degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017647)