Characterization of 2-path signed network

DOI10.1155/2020/1028941MaRDI QIDQ2221636zbMATH OpenOpenAlexFDO

Authors Deepa Sinha, Deepakshi Sharma

Publication date 2 February 2021

Published in Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/1028941

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Signed and weighted graphs (05C22) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 3887734
• On 2-path invariant signed graphs
• Switching invariant two-path signed graphs
• Signed graphs with negative self evaluation and clusterability of graphs
• Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments

Cites work

• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Applications of a new separator theorem for string graphs
• Characterization of signed line digraphs
• Common-edge sigraphs
• Consistency in the naturally vertex-signed line graph of a signed graph
• Correlation clustering with a fixed number of clusters
• Intersection graphs of paths in a tree
• Interval graph limits
• New concepts on vertex and edge coloring of simple vague graphs
• Normal Helly circular-arc graphs and its subclasses
• On Comparability and Permutation Graphs
• On products and line graphs of signed graphs, their eigenvalues and energy
• On the notion of balance of a signed graph
• Optimization problems in dotted interval graphs
• Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
• Robust and minimum spanning tree in fuzzy environment
• Signed analogs of bipartite graphs
• Signed graphs for portfolio analysis in risk management
• Signed intersection graphs
• Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
• Switching invariant two-path signed graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Topics in Intersection Graph Theory
• Triangular line signed graph of a signed graph
• Vertex Intersection Graphs of Paths on a Grid
• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs

Cited in

(1)

• Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments

This page was built for publication: Characterization of 2-path signed network

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