Pages that link to "Item:Q4957961"
From MaRDI portal
The following pages link to Electronic Journal of Graph Theory and Applications (Q4957961):
Displaying 50 items.
- Independent strong domination in complementary prisms (Q4957962) (← links)
- $C_4$-decomposition of the tensor product of complete graphs (Q4957964) (← links)
- A note on the generator subgraph of a graph (Q4957966) (← links)
- An efficient implementation of the Gale and Shapley “propose-and-reject” algorithm (Q4957968) (← links)
- Some new upper bounds for the inverse sum indeg index of graphs (Q4957969) (← links)
- The consecutively super edge-magic deficiency of graphs and related concepts (Q4957970) (← links)
- The rainbow $k$--connectivity of the non-commutative graph of a finite group (Q4957973) (← links)
- Determining the robustness of an interdependent network with a hypergraph model (Q4957974) (← links)
- Congruences and subdirect representations of graphs (Q4957975) (← links)
- Multidesigns for the graph pair formed by the 6-cycle and 3-prism (Q4957977) (← links)
- The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths (Q4957978) (← links)
- On central-peripheral appendage numbers of uniform central graphs (Q4957979) (← links)
- On cycle-irregularity strength of ladders and fan graphs (Q4957980) (← links)
- Three-colour bipartite Ramsey number $R_b(G_1,G_2,P_3)$ (Q4957982) (← links)
- Two classes of non-Leech trees (Q4957983) (← links)
- 16-vertex graphs with automorphism groups A4 and A5 from the icosahedron (Q4957984) (← links)
- Expanding graceful trees (Q4957986) (← links)
- On the non-commuting graph of dihedral group (Q4957989) (← links)
- Problems on chromatic polynomials of hypergraphs (Q4957990) (← links)
- Totally irregular total labeling of some caterpillar graphs (Q4957991) (← links)
- Resistors in dual networks (Q4957993) (← links)
- Uniform edge betweenness centrality (Q4957994) (← links)
- Alpha graphs with different pendent paths (Q4957995) (← links)
- Some structural graph properties of the non-commuting graph of a class of finite Moufang loops (Q4957997) (← links)
- On the crossing number of join product of the discrete graph with special graphs of order five (Q4957998) (← links)
- On the distance domination number of bipartite graphs (Q4958000) (← links)
- Restricted size Ramsey number for P3 versus cycle (Q4958001) (← links)
- The geodetic domination number of comb product graphs (Q4958003) (← links)
- On the restricted size Ramsey number for P3 versus dense connected graphs (Q4958004) (← links)
- On a version of the spectral excess theorem (Q4958005) (← links)
- Total Roman domination for proper interval graphs (Q4958006) (← links)
- Total vertex irregularity strength for trees with many vertices of degree two (Q4958007) (← links)
- Bounds on the ABC spectral radius of a tree (Q4958008) (← links)
- Modular irregularity strength of graphs (Q4958009) (← links)
- The partition dimension of a subdivision of a homogeneous firecracker (Q4958010) (← links)
- Vertex partition of hypergraphs and maximum degenerate subhypergraphs (Q4958039) (← links)
- Total weight choosability for Halin graphs (Q4958040) (← links)
- On distance labelings of 2-regular graphs (Q4958041) (← links)
- A unique and novel graph matrix for efficient extraction of structural information of networks (Q4958043) (← links)
- Some new results on the b-domatic number of graphs (Q4958044) (← links)
- Automorphism groups of some families of bipartite graphs (Q4958046) (← links)
- Distinguishing index of Kronecker product of two graphs (Q4958047) (← links)
- Multi-switch: A tool for finding potential edge-disjoint 1-factors (Q4958048) (← links)
- Roman domination in oriented trees (Q4958049) (← links)
- Degree equitable restrained double domination in graphs (Q4958051) (← links)
- Connected domination value in graphs (Q4958052) (← links)
- On two Laplacian matrices for skew gain graphs (Q4958053) (← links)
- A numeral system for the middle-levels graphs (Q4958054) (← links)
- The structure of the 3x + 1 problem (Q4958055) (← links)
- Perfect codes in some products of graphs (Q4958057) (← links)
