QuACN: Quantitative Analysis of Complex Networks


[Up] [Top]

Documentation for package ‘QuACN’ version 1.3.4

Help Pages

QuACN-package QuACN: Quantitative Analysis of Complex Networks
adjacencyMatrix Adjacency Matrix
atomBondConnectivity Atom-bond connectivity (ABC) index
augmentedMatrix Augmented Matrix
augmentedZagreb Augmented Zagreb index
balabanID Balaban ID number
balabanJ The Balaban J index
balabanlike1 BALABAN-like information index U(G)
balabanlike2 BALABAN-like information index XU(G)
bertz Bertz complexity index
bonchev1 Magnitude-based information index by Bonchev I_D(G)
bonchev2 Magnitude-based information index by Bonchev I_D^W(G)
bondOrderID Conventional bond order ID number
calculateDescriptors Generalized descriptor calculation
compactness Compactness
complexityIndexB The complexity index B
connectivityID Randi\'c connectivity ID number
degreeDistribution Degree Distribution
diameter Diameter
distanceCodeCentric Distance code centric index
distanceDegreeCentric Distance degree centric index
distanceMatrix Distance Matrix
distancePathMatrix Distance Path Matrix
distSumConnectMatrix Distance-sum-connectivity matrix
dobrynin Dobrynin inidces
edgeDeletedSubgraphs Edge-deleted subgraphs
efficiency Efficiency complexity index
eigenvalueBased Eigenvalue-based Descriptors
energy Graph energy
estrada Estrada index
extendedAdjacencyMatrix Extended Adjacency Matrix
geometricArithmetic1 First geometric-arithmetic index
geometricArithmetic2 Second geometric-arithmetic index
geometricArithmetic3 Third geometric-arithmetic index
getLabels This method returns the label of a descripor as expression.
getLargestSubgraph A function to extract the largest subgraph from a graphNEL object
globalClusteringCoeff Global Clustering Coefficient
graphIndexComplexity Graph index complexity measure
graphVertexComplexity Graph Vertex Complexity
harary Harary Index
huXuID Hu-Xu ID number
hyperDistancePathIndex Hyper Distance Path Index
infoTheoreticGCM Information theoretic graph complexity meassures
konstantinova Konstantinova
laplaceMatrix Laplacian Matrix
laplacianEnergy Laplacian energy of a graph
laplacianEstrada Laplacian Estrada index
localClusteringCoeff Local Clustering Coefficient
meanDistanceDeviation Mean Distance Deviation
mediumArticulation Medium articulation index
minBalabanID Balaban ID number considering shortest paths only
minConnectivityID Connectivity ID number considering shortest paths only
modifiedZagreb Modified Zagreb index
narumiKatayama Narumi-Katayama index
normalizedEdgeComplexity Normalized Edge Complexity
offdiagonal Offdiagonal complexity index
oneEdgeDeletedSubgraphComplexity One-edge-deleted subgraph complexity measures
primeID Prime ID number
productOfRowSums Product of Row Sums
QuACN QuACN: Quantitative Analysis of Complex Networks
radialCentric Radial Centric Information Index
randic Randic connectivity index
randomWalkMatrix Random Walk Markov Matrix
spanningTreeSensitivity Spanning tree sensitivity measures
spectralRadius Spectral radius
topologicalInfoContent Topological Information Conten
totalAdjacency Index of total Adjacency
twoEdgesDeletedSubgraphComplexity Two-edges-deleted subgraph complexity
variableZagreb Variable Zagreb index
vertConnectMatrix Vertex Connectivity Matrix
vertexDegree Vertex degree equality-based information index.
weightedID Weighted ID number
weightStrucFuncMatrix_exp Weighted Structure Function Matrix
weightStrucFuncMatrix_lin Weighted Structure Function Matrix
wiener Wiener index
zagreb1 Zagreb group index 1
zagreb2 Zagreb group index 2