The only reference for DIL I could find is a 2016 paper: Evaluating the importance of nodes in complex networks, J Liu, Q Xiong, W Shi, X Shi, K Wang. Is this what you are looking for? There is no way to directly compute the measure defined in that paper in MATLAB, but the formulas for computing it seem relatively straightforward.
One value that the paper requires is the number of triangles containing any edge of the graph. Here is how you can compute this number for all edges in a graph G:
% Make an example graph
rng default; G = graph(sprandn(10, 10, 0.4), 'upper');
% Find source and target nodes for each edge in the graph
[s, t] = findedge(G);
% Adjacency matrix, A(i, j) is 1 if there is an edge (i, j), 0 otherwise
A = adjacency(G);
% For each edge, count number of common neighbors for nodes s and t
nrTriangles = full(sum(A(:, s) .* A(:, t)))';
% Display each edge on one row, giving source node, target node, and number
% of triangles this edge is part of.
[s t nrTriangles]
% Plot the graph for comparison.
plot(G)
Given this and the degree and neighbors methods, you should be able to compute the values defined in the paper above.
