The following pages link to On Complementary Graphs (Q3231818):
Displaying 50 items.
- Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates (Q293628) (← links)
- Split graphs and Nordhaus-Gaddum graphs (Q297938) (← links)
- The rainbow vertex-index of complementary graphs (Q307925) (← links)
- Total rainbow connection number and complementary graph (Q310863) (← links)
- On the signed total Roman domination and domatic numbers of graphs (Q317425) (← links)
- Maximum size of digraphs with some parameters (Q326498) (← links)
- Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (Q367076) (← links)
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
- Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues (Q405284) (← links)
- Nordhaus-Gaddum for treewidth (Q412239) (← links)
- Multiple factor Nordhaus-Gaddum type results for domination and total domination (Q423926) (← links)
- The signed Roman \(k\)-domatic number of a graph (Q476316) (← links)
- On rainbow total-coloring of a graph (Q494442) (← links)
- Some results on the reciprocal sum-degree distance of graphs (Q498415) (← links)
- More bounds for the Grundy number of graphs (Q511707) (← links)
- Harmonious colourings of graphs (Q516809) (← links)
- An inertial lower bound for the chromatic number of a graph (Q521386) (← links)
- On the graph complement conjecture for minimum semidefinite rank (Q551287) (← links)
- On Harary index (Q551958) (← links)
- A new like quantity based on ``Estrada index'' (Q608014) (← links)
- Inequalities of Nordhaus-Gaddum type for doubly connected domination number (Q608251) (← links)
- The bipartite edge frustration of composite graphs (Q608263) (← links)
- On ordinary generalized geometric-arithmetic index (Q617038) (← links)
- Improper C-colorings of graphs (Q629357) (← links)
- Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts (Q642989) (← links)
- New Nordhaus-Gaddum-type results for the Kirchhoff index (Q645165) (← links)
- Using size for bounding expressions of graph invariants (Q646725) (← links)
- Extremal properties of reciprocal complementary Wiener number of trees (Q651516) (← links)
- Connected domination number of a graph and its complement (Q659759) (← links)
- The Nordhaus-Gaddum-type inequality for the Wiener polarity index (Q668559) (← links)
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264) (← links)
- Bounded vertex colorings of graphs (Q686481) (← links)
- The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs (Q712586) (← links)
- Proper connection numbers of complementary graphs (Q723592) (← links)
- The vertex-rainbow index of a graph (Q726646) (← links)
- Nordhaus-Gaddum-type results for resistance distance-based graph invariants (Q726649) (← links)
- Beyond graph energy: norms of graphs and matrices (Q739093) (← links)
- Nordhaus-Gaddum-type relations of three graph coloring parameters (Q741774) (← links)
- Open problems on graph eigenvalues studied with AutoGraphiX (Q743636) (← links)
- Nordhaus-Gaddum type inequalities for some distance-based indices of bipartite molecular graphs (Q780337) (← links)
- More on limited packings in graphs (Q782753) (← links)
- Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energy (Q783162) (← links)
- Graph factorization and theorems of the Nordhaus-Gaddum class (Q802576) (← links)
- Relations between parameters of a graph (Q802633) (← links)
- On incidence energy of a graph (Q837002) (← links)
- On geometric-arithmetic index (Q848202) (← links)
- On strong (weak) independent sets and vertex coverings of a graph (Q870977) (← links)
- Bounds on the (Laplacian) spectral radius of graphs (Q875030) (← links)
- Super dominating sets in graphs (Q890164) (← links)
- Domination in 4-regular graphs with girth 3 (Q893494) (← links)
