Pages that link to "Item:Q4680413"
From MaRDI portal
The following pages link to On restricted connectivities of permutation graphs (Q4680413):
Displaying 21 items.
- Sufficient conditions for \(k\)-restricted edge connected graphs (Q300253) (← links)
- On the geodetic number of permutation graphs (Q741406) (← links)
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected (Q763501) (← links)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey (Q932603) (← links)
- Connectivity measures in matched sum graphs (Q952660) (← links)
- Cyclic arc-connectivity in a Cartesian product digraph (Q975283) (← links)
- Some remarks on \(\lambda _{p,q}\)-connectedness (Q998437) (← links)
- On super edge-connectivity of product graphs (Q1002278) (← links)
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 (Q1011727) (← links)
- On the 3-restricted edge connectivity of permutation graphs (Q1028132) (← links)
- The super-connectivity of Kneser graphs (Q1630915) (← links)
- Connectivity of strong products of graphs (Q1959713) (← links)
- The fractional metric dimension of permutation graphs (Q2018874) (← links)
- On the broadcast domination number of permutation graphs (Q2285130) (← links)
- On the edge-connectivity and restricted edge-connectivity of a product of graphs (Q2462383) (← links)
- Disjunctive total domination in permutation graphs (Q2966509) (← links)
- Neighborhood conditions for graphs to be super restricted edge connected (Q3057163) (← links)
- Highly connected star product graphs (Q3439647) (← links)
- On super connectivity of Cartesian product graphs (Q3528152) (← links)
- Reliability of interconnection networks modeled by Cartesian product digraphs (Q3548720) (← links)
- The super-connectivity of Kneser graph KG(n,3) (Q5080914) (← links)