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

DOI10.1134/S1064230714050128MaRDI QIDQ2017647zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

characteristic functionsflows in networkssum of arc weights

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

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 DE number 4139561

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 5654190 (Why is no real title available?)
• scientific article; zbMATH DE number 803930 (Why is no real title available?)
• A minimax under nonlinear transportation constraints.
• A triplanar transportation problem with a minimax criterion
• Approximation and decomposition by extremal graphs
• Closed transportation models with minimax criterion
• Method of partition of networks with fixed degrees of nodes and network flows
• Minimax in transportation models with integral constraints. I
• Minimax in transportation models with integral constraints. II
• Minimax under transportation constraints
• Network models with fixed parameters at the communication nodes. I
• Network models with fixed parameters at the communication nodes. II
• Open transportation models with a minimax criterion.
• Transport and network problems with the minimax criterion
• Transport-type problems with a minimax criterion
• Transportation problems with a minimax criterion
• Weighted graphs with fixed vertex degrees and network flows

Cited in

(6)

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

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)