Wolfram Language Paclet Repository

Community-contributed installable additions to the Wolfram Language

Primary Navigation

    • Cloud & Deployment
    • Core Language & Structure
    • Data Manipulation & Analysis
    • Engineering Data & Computation
    • External Interfaces & Connections
    • Financial Data & Computation
    • Geographic Data & Computation
    • Geometry
    • Graphs & Networks
    • Higher Mathematical Computation
    • Images
    • Knowledge Representation & Natural Language
    • Machine Learning
    • Notebook Documents & Presentation
    • Scientific and Medical Data & Computation
    • Social, Cultural & Linguistic Data
    • Strings & Text
    • Symbolic & Numeric Computation
    • System Operation & Setup
    • Time-Related Computation
    • User Interface Construction
    • Visualization & Graphics
    • Random Paclet
    • Alphabetical List
  • Using Paclets
    • Get Started
    • Download Definition Notebook
  • Learn More about Wolfram Language

Networks

Symbols

  • AdjacencyEigenvalues
  • Ancestors
  • AsteroidalTripleFreeQ
  • BranchingQ
  • BreadthFirstSearch
  • CliqueNumber
  • CliquesCount
  • CliquesRing
  • CommonNeighbors
  • ConnectedComponentsCount
  • CycleAdd
  • DegreeHistogram
  • DepthFirstSearch
  • Descendants
  • EdgeBoundary
  • FindAsteroidalTriple
  • ForestQ
  • Girth
  • GraphWeights
  • HexagonalGridGraph
  • IsolatesCount
  • Isolates
  • IsolatesQ
  • LaplacianEigenvalues
  • LCFGraph
  • LollipopGraph
  • MaxCliquesCount
  • NonIsomorphicComponents
  • NonNeighbors
  • PathAdd
  • PeriodicGraphQ
  • Predecessor
  • PseudofractalScaleFreeGraph
  • RegularGraphQ
  • SelfloopsCount
  • Selfloops
  • SelfloopsQ
  • SemiconnectedGraphQ
  • StarAdd
  • SteinerTree
  • StronglyRegularGraphQ
  • Tournament
  • TournamentQ
  • VertexBoundary
  • VertexCleaving
  • WeaklyConnectedComponentsCount
WolframRD`Networks`
SemiconnectedGraphQ
​
SemiconnectedGraphQ[g]
yields
True
if the graph
g
is semi-connected, and
False
otherwise.
​
Details

Examples  
(10)
Basic Examples  
(1)
Test whether a graph is semi-connected:
In[1]:=
SemiconnectedGraphQ


Out[1]=
True
Scope  
(5)

Properties & Relations  
(4)

SeeAlso
NonIsomorphicComponents
▪
StronglyRegularGraphQ
▪
TournamentQ
▪
RegularGraphQ
""

© 2025 Wolfram. All rights reserved.

  • Legal & Privacy Policy
  • Contact Us
  • WolframAlpha.com
  • WolframCloud.com